Skip to main content
SpringerLink
Log in

ileanTAP: An intuitionistic theorem prover

  • Contributed Papers
  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1997)

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

Abstract

We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string unification to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the different logical connectives the implementation can easily be adapted to deal with other non-classical logics.

The author is supported by the Adolf Messer Stiftung

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Beckert and J. Posegga. leanTAP: Lean Tableau-Based Theorem Proving. Proc. CADE-12, LNAI 814, pp. 793–797, Springer Verlag, 1994.

    Google Scholar 

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

    Google Scholar 

  3. R. Dyckhoff. Contraction-free Sequent Calculi for Intuitionistic Logic. Journal of Symbolic Logic, 57(3):795–807, 1992.

    Google Scholar 

  4. M. C. Fitting. First-Order Logic and Automated Theorem Proving. Springer Verlag, 1990.

    Google Scholar 

  5. J. Otten, C. Kreitz. A Connection-Based Proof Method for Intuitionistic Logic. Proc. 4thTABLEAUX Workshop, LNAI 918, pp. 122–137, 1995.

    Google Scholar 

  6. J. Otten, C. Kreitz. T-String-Unification: Unifying Prefixes in Non-Classical Proof Methods. Proc. 5thTABLEAUX Workshop, LNAI 1071, pp. 244–260, 1996.

    Google Scholar 

  7. J. Otten, C. Kreitz. A Uniform Proof Procedure for Classical and Non-Classical Logics. KI-96: Advances in Artificial Intelligence, LNAI, Springer Verlag, 1996.

    Google Scholar 

  8. D. Sahlin, T. Franzen, S. Haridi. An Intuitionistic Predicate Logic Theorem Prover. Journal of Logic and Computation, 2(5):619–656, 1992.

    Google Scholar 

  9. T. Tammet. A Resolution Theorem Prover for Intuitionistic Logic. Proc. CADE-13, LNAI, Springer Verlag, 1996.

    Google Scholar 

  10. L. Wallen. Automated deduction in nonclassical logic. MIT Press, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachgebiet Intellektik Fachbereich Informatik, Technische Hochschule Darmstadt, Alexanderstr. 10, 64283, Darmstadt, Germany

    Jens Otten

Authors
  1. Jens Otten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Didier Galmiche

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otten, J. (1997). ileanTAP: An intuitionistic theorem prover. In: Galmiche, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1997. Lecture Notes in Computer Science, vol 1227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027422

Download citation

  • DOI: https://doi.org/10.1007/BFb0027422

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62920-7

  • Online ISBN: 978-3-540-69046-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation