Skip to main content
Springer Nature Link
Log in

The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2005)

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

Abstract

The Intuitionistic Logic Theorem Proving (ILTP) Library provides a platfom for testing and benchmarking theorem provers for first-order intuitionistic logic. It includes a collection of benchmark problems in a standardised syntax and performance results obtained by a comprehensive test of currently available intuitionistic theorem proving systems. These results are used to provide information about the status and the difficulty rating of the benchmark problems.

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.

Similar content being viewed by others

References

  1. Balsiger, P., Heuerding, A., Schwendimann, S.: Logics workbench 1.0. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 35–37. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Bertot, Y., Castéran, P.: Interactive theorem proving and program development. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  3. Constable, R.L., et al: Implementing mathematics with the NuPRL proof development system. Prentice Hall, Englewood Cliffs (1986)

    Google Scholar 

  4. Larchey-Wendling, D., Méry, D., Galmiche, D.: STRIP: Structural sharing for efficient proof-search. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 696–700. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Otten, J.: ileantap: An intuitionistic theorem prover. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS (LNAI), vol. 1227, pp. 307–312. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. Otten, J.: Clausal connection-based theorem proving in intuitionistic first-order logic. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 245–261. Springer, Heidelberg (2005), http://www.leancop.de

    Chapter  Google Scholar 

  7. Raths, T.: Evaluating intuitionistic automated theorem provers. Technical Report, University of Potsdam (2005)

    Google Scholar 

  8. Sahlin, D., Franzen, T., Haridi, S.: An intuitionistic predicate logic theorem prover. Journal of Logic and Computation 2, 619–656 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  9. Schmitt, S., et al.: JProver: Integrating connection-based theorem proving into interactive proof assistants. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 421–426. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Sutcliffe, G., Suttner, C.: The TPTP problem library - CNF release v1.2.1. Journal of Automated Reasoning 21, 177–203 (1998), http://www.cs.miami.edu/~tptp

    Article  MATH  MathSciNet  Google Scholar 

  11. Tammet, T.: A resolution theorem prover for intuitionistic logic. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS (LNAI), vol. 1104, pp. 2–16. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, University of Potsdam, August-Bebel-Str. 89, 14482, Potsdam-Babelsberg, Germany

    Thomas Raths, Jens Otten & Christoph Kreitz

Authors
  1. Thomas Raths
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Otten
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christoph Kreitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Koblenz-Landau,  

    Bernhard Beckert

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raths, T., Otten, J., Kreitz, C. (2005). The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic. In: Beckert, B. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2005. Lecture Notes in Computer Science(), vol 3702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554554_28

Download citation

  • DOI: https://doi.org/10.1007/11554554_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28931-9

  • Online ISBN: 978-3-540-31822-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation