leanK 2.0

  • Bernhard Beckert
  • Rajeev Goré
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1397)


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.


  1. 1.
    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.Google Scholar
  2. 2.
    Bernhard Beckert and Joachim Posegga. leanTAP: Lean, Tableau-based Deduction. Journal of Automated Reasoning, Vol. 15, No. 3, pages 339–358, 1995.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Bernhard Beckert
    • 1
  • Rajeev Goré
    • 2
  1. 1.Institute for Logic, Complexity and Deduction SystemsUniversity of KarlsruheKarlsruheGermany
  2. 2.Automated Reasoning ProjectAustralia National UniversityCanberraAustralia

Personalised recommendations