The TPTP typed first-order form with arithmetic

Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Peter Baumgartner

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

35 Scopus citations

Abstract

The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has been extended to include a typed first-order logic, which in turn has enabled the integration of arithmetic. This paper describes these developments.

Original languageEnglish (US)
Title of host publicationLogic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference, LPAR-18, Proceedings
Pages406-419
Number of pages14
DOIs
StatePublished - 2012
Event18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-18 - Merida, Venezuela, Bolivarian Republic of
Duration: Mar 11 2012Mar 15 2012

Publication series

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

Other

Other18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-18
CountryVenezuela, Bolivarian Republic of
CityMerida
Period3/11/123/15/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The TPTP typed first-order form with arithmetic'. Together they form a unique fingerprint.

Cite this