| Publication type: |
Article in Proceedings |
| Author: |
Lutz Schröder, Dirk Pattinson, Daniel Hausmann |
| Editor: |
Michael Wooldridge |
| Title: |
Optimal Tableaux for Conditional Logics with Cautious Monotonicity |
| Book / Collection title: |
European Conference on Artificial Intelligence (ECAI 2010) |
| Volume: |
215 |
| Page(s): |
707 – 712 |
| Series: |
Frontiers in Artificial Intelligence and Applications |
| Year published: |
2010 |
| Publisher: |
IOS Press |
| Abstract: |
Conditional logics capture default entailment in a modal framework
in which non-monotonic implication becomes a first-class citizen, and
in particular can be negated and nested. There is a wide range of
axiomatizations of conditionals in the literature, from weak systems
such as the basic conditional logic CK, which allows only for
equivalent exchange of conditional antecedents, to strong systems
such as Burgess' system S, which imposes the full
Kraus-Lehmann-Magidor properties of preferential logic. While
tableaux systems implementing the actual complexity of the logic at
hand have recently been developed for several weak systems, strong
systems including in particular disjunction elimination or cautious
monotonicity have so far eluded such efforts; previous results for
strong systems are limited to semantics-based decision procedures
and completeness proofs for Hilbert-style axiomatizations. Here, we
present tableaux systems of optimal complexity PSpace for several
strong axiom systems in conditional logic, including system S; the
arising decision procedure for system S is implemented in the
generic reasoning tool CoLoSS.
|
| PDF Version: |
http://www.informatik.uni-bremen.de/~lschrode/papers/CondTableaux.pdf |
| Keywords: |
Conditional logic coalgebra tableaux system S cautious monotony |
| Status: |
Reviewed |
| Last updated: |
07. 10. 2010 |
