Abstract
In this paper we present CondLean, a theorem prover for propositional conditional logics CK, CK+ID, CK+MP and CK+MP+ID. The theorem prover implements some recently introduced sequent calculi for these logics. CondLean is developed following the methodology of leanTAP and it is implemented in SICStus Prolog. It also comprises a graphical user interface implemented in JAVA. CondLean can be downloaded at the site www.di.unito.it/ olivetti/CONDLEAN/
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Olivetti, N., Schwind, C.B.: A calculus and complexity bound for minimal conditional logic. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, p. 384. Springer, Heidelberg (2001)
Beckert, B., Goré, R.: Free Variable Tableaux for Propositional Modal Logics. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol. 1227. Springer, Heidelberg (1997)
Nute, D.: Topics in conditional logic. Reidel, Dordrecht (1980)
Pozzato, G.L.: Deduzione automatica per logiche condizionali: analisi e sviluppo di un theorem prover. Tesi di laurea, Informatica, Universit‘a di Torino (2003)
Beckert, B., Posegga, J.: leanTAP: Lean tableau-based deduction. Journal of Logic Programming 28 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olivetti, N., Pozzato, G.L. (2003). CondLean: A Theorem Prover for Conditional Logics. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-45206-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40787-4
Online ISBN: 978-3-540-45206-5
eBook Packages: Springer Book Archive