Skip to main content
SpringerLink
Log in

Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation

  • Conference paper
Automated Reasoning (IJCAR 2006)

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

Included in the following conference series:

Abstract

A stable proposal for extending the first-order TPTP (Thousands of Problems for Theorem Provers) language to higher-order logic, based primarily on lambda-calculus expressions, is presented. The purpose of the system is to facilitate sharing of theorem-proving problems in higher-order logic among many researchers. Design goals are discussed. BNF2, a new specification language, is presented. Unix/Linux scripts translate the specification document into a lex scanner andyacc parser.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benzmüller, C., Brown, C.: A Structured Set of Higher-Order Problems. In: Proc. 18th Theorem Proving in Higher Order Logics, pp. 66–81 (2005)

    Google Scholar 

  2. Felty, D., et al.: The Coq Proof Assistant, http://pauillac.inria.fr/coq

  3. Forsberg, M., Ranta, A.: The Labelled BNF Grammar Formalism. Technical report, Chalmers, Gothenburg, Sweden (2005), http://www.cs.chalmers.se/~markus/BNFC

  4. Harper, R., Honsell, F., Plotkin, G.: A Framework for Defining Logics. Journal of the ACM 40(1), 143–184 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hudak, P.: Conception, Evolution, and Application of Functional Programming Languages. ACM Computing Surveys 21, 359–411 (1989)

    Article  Google Scholar 

  6. Naur, P., et al.: Report on Algorithmic Language ALGOL 60. Communications of the ACM 3, 299–314 (1960)

    Article  MathSciNet  Google Scholar 

  7. Pfenning, F.: ELF: A meta-language for deductive systems (system description). In: Bundy, A. (ed.) CADE 1994. LNCS, vol. 814, Springer, Heidelberg (1994)

    Google Scholar 

  8. Sutcliffe, G., Suttner, C.B.: The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning 21(2), 177–203 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Sutcliffe, G., Zimmer, J., Schulz, S.: TSTP Data-Exchange Formats for Automated Theorem Proving Tools. In: Distributed Constraint Problem Solving and Reasoning in Multi-Agent Systems, pp. 201–215. IOS Press, Amsterdam (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California at Santa Cruz, USA

    Allen Van Gelder

  2. University of Miami, USA

    Geoff Sutcliffe

Authors
  1. Allen Van Gelder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Geoff Sutcliffe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Artificial Intelligence Research Group, University of Koblenz-Landau, Universitätsstr. 1, 56070, Koblenz

    Ulrich Furbach

  2. SRI International, MS EL256,, 333 Ravenswood Avenue, 94025-3493, Menlo Park, CA, USA

    Natarajan Shankar

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Gelder, A., Sutcliffe, G. (2006). Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation. In: Furbach, U., Shankar, N. (eds) Automated Reasoning. IJCAR 2006. Lecture Notes in Computer Science(), vol 4130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814771_15

Download citation

  • DOI: https://doi.org/10.1007/11814771_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37187-8

  • Online ISBN: 978-3-540-37188-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation