Using the TPTP language for writing derivations and finite interpretations

Geoffrey Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder

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

26 Citations (Scopus)

Abstract

One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as problems, in conjunction with the simplicity of the syntax, sets it apart from other languages used in ATP. This paper provides a complete definition of the TPTP language, and describes how the language should be used to write derivations and finite interpretations.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages67-81
Number of pages15
Volume4130 LNAI
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Adenosinetriphosphate
Language
Adenosine Triphosphate
Aptitude
Simplicity
Express
Interpretation

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Sutcliffe, G., Schulz, S., Claessen, K., & Van Gelder, A. (2006). Using the TPTP language for writing derivations and finite interpretations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4130 LNAI, pp. 67-81). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4130 LNAI).

Using the TPTP language for writing derivations and finite interpretations. / Sutcliffe, Geoffrey; Schulz, Stephan; Claessen, Koen; Van Gelder, Allen.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4130 LNAI 2006. p. 67-81 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4130 LNAI).

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

Sutcliffe, G, Schulz, S, Claessen, K & Van Gelder, A 2006, Using the TPTP language for writing derivations and finite interpretations. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4130 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4130 LNAI, pp. 67-81, Third International Joint Conference on Automated Reasoning, IJCAR 2006, Seattle, WA, United States, 8/17/06.
Sutcliffe G, Schulz S, Claessen K, Van Gelder A. Using the TPTP language for writing derivations and finite interpretations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4130 LNAI. 2006. p. 67-81. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sutcliffe, Geoffrey ; Schulz, Stephan ; Claessen, Koen ; Van Gelder, Allen. / Using the TPTP language for writing derivations and finite interpretations. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4130 LNAI 2006. pp. 67-81 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a6a4ff72552e4de78ccf96e92544ce50,
title = "Using the TPTP language for writing derivations and finite interpretations",
abstract = "One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as problems, in conjunction with the simplicity of the syntax, sets it apart from other languages used in ATP. This paper provides a complete definition of the TPTP language, and describes how the language should be used to write derivations and finite interpretations.",
author = "Geoffrey Sutcliffe and Stephan Schulz and Koen Claessen and {Van Gelder}, Allen",
year = "2006",
language = "English (US)",
isbn = "3540371877",
volume = "4130 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "67--81",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Using the TPTP language for writing derivations and finite interpretations

AU - Sutcliffe, Geoffrey

AU - Schulz, Stephan

AU - Claessen, Koen

AU - Van Gelder, Allen

PY - 2006

Y1 - 2006

N2 - One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as problems, in conjunction with the simplicity of the syntax, sets it apart from other languages used in ATP. This paper provides a complete definition of the TPTP language, and describes how the language should be used to write derivations and finite interpretations.

AB - One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as problems, in conjunction with the simplicity of the syntax, sets it apart from other languages used in ATP. This paper provides a complete definition of the TPTP language, and describes how the language should be used to write derivations and finite interpretations.

UR - http://www.scopus.com/inward/record.url?scp=33749549302&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749549302&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540371877

SN - 9783540371878

VL - 4130 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 67

EP - 81

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -