Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Conditional logics of normality: a modal approach
Artificial Intelligence
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
A sequent calculus and a theorem prover for standard conditional logics
ACM Transactions on Computational Logic (TOCL)
Analytic tableaux calculi for KLM logics of nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Optimizing Conditional Logic Reasoning within CoLoSS
Electronic Notes in Theoretical Computer Science (ENTCS)
Revision by conditional beliefs
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Cut elimination in coalgebraic logics
Information and Computation
Nested rules in defeasible logic
RuleML'05 Proceedings of the First international conference on Rules and Rule Markup Languages for the Semantic Web
Nested sequent calculi for conditional logics
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Sequent systems for lewis' conditional logics
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Embedding and automating conditional logics in classical higher-order logic
Annals of Mathematics and Artificial Intelligence
Automating quantified conditional logics in HOL
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
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 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.