Extending the TPTP language to higher-order logic with automated parser generation

Allen Van Gelder, Geoff Sutcliffe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

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 and yacc parser.

Original languageEnglish (US)
Title of host publicationAutomated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings
PublisherSpringer Verlag
Pages156-161
Number of pages6
ISBN (Print)3540371877, 9783540371878
DOIs
StatePublished - 2006
EventThird International Joint Conference on Automated Reasoning, IJCAR 2006 - Seattle, WA, United States
Duration: Aug 17 2006Aug 20 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4130 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherThird International Joint Conference on Automated Reasoning, IJCAR 2006
CountryUnited States
CitySeattle, WA
Period8/17/068/20/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Extending the TPTP language to higher-order logic with automated parser generation'. Together they form a unique fingerprint.

Cite this