Sign in
Back
Using the TPTP Language for Writing Derivations and Finite Interpretations
Book chapter   Peer reviewed

Using the TPTP Language for Writing Derivations and Finite Interpretations

Geoff Sutcliffe, Stephan Schulz, Koen Claessen and Allen Van Gelder
Automated Reasoning, pp.67-81
Lecture Notes in Computer Science, Springer Berlin Heidelberg
2006
DOI: https://doi.org/10.1007/11814771_7

Abstract

Distinct Object System Predicate Inference Rule Domain Element Inference Step
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.

Metrics

14 Record Views

Details