Artificial Intelligence
Structure, consequence relation and logic
What is a logical system?
Basic proof theory (2nd ed.)
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)
Tableau calculus for preference-based conditional logics: PCL and its extensions
ACM Transactions on Computational Logic (TOCL)
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
Journal of Logic, Language and Information
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Cut elimination for shallow modal logics
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
| Hi-index | 0.00 |
We present unlabelled cut-free sequent calculi for Lewis' conditional logic $\mathbb V$ and extensions, in both the languages with the entrenchment connective and the strong conditional. The calculi give rise to Pspace-decision procedures, also in the language with the weak conditional. Furthermore, they are used to prove the Craig interpolation property for all the logics under consideration, and yield a Pspace-decision procedure for a recently considered hybrid version of $\mathbb V$.