A Calculus and Complexity Bound for Minimal Conditional Logic
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Free Variable Tableaux for Propositional Modal Logics
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A sequent calculus and a theorem prover for standard conditional logics
ACM Transactions on Computational Logic (TOCL)
Conditional and Preferential Logics: Proof Methods and Theorem Proving
Proceedings of the 2010 conference on Conditional and Preferential Logics: Proof Methods and Theorem Proving
CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper we present CondLean 3.0, a theorem prover for propositional conditional logics CK, CK+ID, CK+MP, CK+CS, CK+CEM and some of their combinations. CondLean 3.0 implements sequent calculi for these logics. CondLean 3.0 improves CondLean and is developed following the methodology of leanTAP. It is implemented in SICStus Prolog and also comprises a graphical user interface implemented in JAVA. CondLean 3.0 can be downloaded at www.di.unito.it/~pozzato/condlean3/