Abstract
leanK 2.0 implements an extension of the “Free Variable Tableaux for Propositional Modal Logics” reported by us in [1]. It performs depth first search and is based upon the original leanTAP prover of Beckert and Posegga [2]. Formulae annotated with labels containing variables capture the universal and existential nature of the box and diamond modalities, respectively, with different variable bindings closing different branches. Prolog’s built-in clause indexing scheme, unification facilities and built-in backtracking are used extensively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bernhard Beckert and Rajeev Goré. Free Variable Tableaux for Propositional Modal Logics. In Proceedings, International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Pont-a-Mousson, France, pages 91–106. Springer, LNCS 1227, 1997.
Bernhard Beckert and Joachim Posegga. leanTAP: Lean, Tableau-based Deduction. Journal of Automated Reasoning, Vol. 15, No. 3, pages 339–358, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beckert, B., Goré, R. (1998). leanK 2.0. In: de Swart, H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1998. Lecture Notes in Computer Science(), vol 1397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69778-0_7
Download citation
DOI: https://doi.org/10.1007/3-540-69778-0_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64406-4
Online ISBN: 978-3-540-69778-7
eBook Packages: Springer Book Archive