Optimal tableaux for conditional logics with cautious monotonicity
Date
2010
Authors
Schröder , Lutz
Pattinson, Dirk
Hausmann, D.
Journal Title
Journal ISSN
Volume Title
Publisher
IOS Press
Abstract
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is 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, 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 ; the arising decision procedure for system is implemented in the generic reasoning tool CoLoSS.
Description
Keywords
Citation
Collections
Source
Frontiers in Artificial Intelligence and Applications
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description