Skip to main content
Log in

The ILTP Problem Library for Intuitionistic Logic

Release v1.1

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

The Intuitionistic Logic Theorem Proving (ILTP) library provides a platform for testing and benchmarking automated theorem proving (ATP) systems for intuitionistic propositional and first-order logic. It includes about 2,800 problems in a standardized syntax from 24 problem domains. For each problem an intuitionistic status and difficulty rating were obtained by running comprehensive tests of currently available intuitionistic ATP systems on all problems in the library. Thus, for the first time, the testing and evaluation of ATP systems for intuitionistic logic have been put on a firm basis.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Allen, S., Constable, R., Eaton, R., Kreitz, C., Lorigo, L.: The NuPRL open logical environment. In: 17th CADE, Lecture Notes in Artificial Intelligence, vol. 1831, pp. 170–176. Springer, Berlin Heidelberg New York (2000)

    Google Scholar 

  2. Avellone, A., Fiorino, G., Moscato, U.: A new o(n log n)-space decision procedure for propositional intuitionistic logic. In: Kurt Gödel Society Collegium Logicum, vol. VIII, pp. 17–33. KGS (2004)

  3. Balsiger, P., Heuerding, A., Schwendimann, S.: Logics workbench 1.0. In: 7th TABLEAUX Conference, Lecture Notes in Computer Science, vol. 1397, pp. 35–37. Springer, Berlin Heidelberg New York (1998)

    Google Scholar 

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

    Google Scholar 

  5. Chang, C.-L., Lee, R.: Symbolic Logic and Mechanical Theorem Proving. Academic, New York (1973)

    MATH  Google Scholar 

  6. Dafa, L.: Replacing the axioms for connecting lines and intersection points by two single axioms. AAR Newsletter 37, 1–7 (1997)

    Google Scholar 

  7. Dafa, L.: A shorter and intuitive axiom to replace the third axiom of compatibility of equality with apartness and convergence. AAR Newsletter 39, 1–6 (1998)

    Google Scholar 

  8. Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. Symb. Log. 57, 795–807 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hoos, H., Stützle, T.: SATLIB: An online resource for research on SAT. In: SAT 2000, pp. 283–292. IOS Press, Amsterdam, The Netherlands (2000) (available at http://www.satlib.org)

  10. Larchey-Wendling, D., Méry, D., Galmiche, D.: STRIP: Structural sharing for efficient proof-search. In: IJCAR-2001, Lecture Notes in Artificial Intelligence, vol. 2083, pp. 696–700. Springer, Berlin Heidelberg New York (2001)

    Google Scholar 

  11. Otten, J.: \(\sf {ileanTAP}\): An intuitionistic theorem prover. In: 6th TABLEAUX Conference, Lecture Notes Artificial Intelligence, vol. 1227, pp. 307–312. Springer, Berlin Heidelberg New York (1997)

    Google Scholar 

  12. Otten, J.: Clausal connection-based theorem proving in intuitionistic first-order logic. In: TABLEAUX 2005, Lecture Notes in Artificial Intelligence, vol. 3702, pp. 245–261. Springer, Berlin Heidelberg New York (2005) (available at http://www.leancop.de)

  13. von Plato, J.: The axioms of constructive geometry. Ann. Pure Appl. Logic 76(2), 169–200 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  14. Raths, T.: Evaluating intuitionistic automated theorem provers. Technical Report, University of Potsdam (2005) (available at http://www.iltp.de)

  15. Raths, T., Otten, J., Kreitz, C.: The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic. In: TABLEAUX 2005, Lecture Notes in Artificial Intelligence, vol. 3702, pp. 333–337. Springer, Berlin Heidelberg New York (2005)

    Google Scholar 

  16. Sahlin, D., Franzen, T., Haridi, S.: An intuitionistic predicate logic theorem prover. J. Log. Comput. 2, 619–656 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Schmitt, S., Lorigo, L., Kreitz, C., Nogin, A.: JProver: Integrating connection-based theorem proving into interactive proof assistants. In: IJCAR-2001, Lecture Notes in Artificial Intelligence, vol. 2083, pp. 421–426. Springer, Berlin Heidelberg New York (2001)

    Google Scholar 

  18. Sutcliffe, G., Suttner, C.: The TPTP problem library – CNF release v1.2.1. J. Autom. Reason. 21, 177–203 (1998) (available at http://www.tptp.org)

    Google Scholar 

  19. Tammet, T.: A resolution theorem prover for intuitionistic logic. In: 13th CADE, Lecture Notes in Artificial Intelligence, vol. 1104, pp. 2–16. Springer, Berlin Heidelberg New York (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thomas Raths.

Additional information

The first author’s research is sponsored by DARPA under agreement number FA8750-04-2-0216.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raths, T., Otten, J. & Kreitz, C. The ILTP Problem Library for Intuitionistic Logic. J Autom Reasoning 38, 261–271 (2007). https://doi.org/10.1007/s10817-006-9060-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-006-9060-z

Key words

Navigation