Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1998: Automated Deduction — CADE-15 pp 51–55Cite as

System description: leanK 2.0

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1421))

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.

Unable to display preview. Download preview PDF.

References

  1. B. Beckert and R. Goré. Free variable tableaux for prepositional modal logics. In Proceedings, TABLEAUX-97, LNCS 1227, pages 91–106. Springer, 1997.

    Google Scholar 

  2. B. Beckert and J. Posegga. leanTAP: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339–358, 1995.

    Article  MathSciNet  Google Scholar 

  3. M. Fitting. Proof Methods for Modal and Intuitionistic Logics, volume 169 of Synthese Library. D. Reidel, Dordrecht, Holland, 1983.

    Google Scholar 

  4. R. Goré. Tableau methods for modal and temporal logics. In Handbook of Tableau Methods, Kluwer, Dordrecht, 1998. To appear.

    Google Scholar 

  5. G. Governatori. Labelled tableaux for multi-modal logics. In Proceedings, TABLEAUX-95, LNCS 918, pages 79–94. Springer, 1995.

    Google Scholar 

  6. J. Pitt and J. Cunningham. Distributed modal theorem proving with KE. In Proceedings, TABLEAUX-96, LNAI 1071, pages 160–176. Springer, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Logic, Complexity and Deduction Systems, University of Karlsruhe, D-76128, Karlsruhe, Germany

    Bernhard Beckert

  2. Automated Reasoning Project and Department of Computer Science, Australian National University, 0200, Canberra, ACT, Australia

    Rajeev Goré

Authors
  1. Bernhard Beckert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Goré
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Claude Kirchner Hélène Kirchner

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation