Abstract
leanK is a “lean”, i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additional search space restrictions and fairness strategies, giving a decision procedure for the logics K, KT, and S4.
Supported by the Australian Research Council via a Queen Elizabeth II Fellowship.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B. Beckert and R. Goré. Free variable tableaux for prepositional modal logics. In Proceedings, TABLEAUX-97, LNCS 1227, pages 91–106. Springer, 1997.
B. Beckert and J. Posegga. leanTAP: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339–358, 1995.
M. Fitting. Proof Methods for Modal and Intuitionistic Logics, volume 169 of Synthese Library. D. Reidel, Dordrecht, Holland, 1983.
R. Goré. Tableau methods for modal and temporal logics. In Handbook of Tableau Methods, Kluwer, Dordrecht, 1998. To appear.
G. Governatori. Labelled tableaux for multi-modal logics. In Proceedings, TABLEAUX-95, LNCS 918, pages 79–94. Springer, 1995.
J. Pitt and J. Cunningham. Distributed modal theorem proving with KE. In Proceedings, TABLEAUX-96, LNAI 1071, pages 160–176. Springer, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beckert, B., Goré, R. (1998). System description: leanK 2.0. In: Kirchner, C., Kirchner, H. (eds) Automated Deduction — CADE-15. CADE 1998. Lecture Notes in Computer Science, vol 1421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054247
Download citation
DOI: https://doi.org/10.1007/BFb0054247
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64675-4
Online ISBN: 978-3-540-69110-5
eBook Packages: Springer Book Archive