TSTP Data-Exchange Formats for Automated Theorem Proving Tools

This paper describes two data-exchange formats for Automated Theorem Proving (ATP) tools. First, a language for writing the problems that are input to ATP systems, and for writing the solutions that are output from ATP systems, is described. Second, a hierarchy of values for specifying the logical status of an ATP problem, as may be established by an ATP system, is described. These data-exchange formats will support application and research in ATP, and will facilitate communication between ATP tools in distributed and embedded environments.

[1]  Josef Urban.  Translating Mizar for First Order Theorem Provers , 2003, MKM.

[2]  M. R. Genesereth,et al.  Knowledge Interchange Format Version 3.0 Reference Manual , 1992, LICS 1992.

[3]  Johann Schumann,et al.  Synthesizing Certified Code , 2002, FME.

[4]  Stephan Schulz.  Learning Search Control Knowledge for Equational Theorem Proving , 2001, KI/ÖGAI.

[5]  William McCune,et al.  Solution of the Robbins Problem , 1997, Journal of Automated Reasoning.

[6]  Andrei Voronkov,et al.  Splitting Without Backtracking , 2001, IJCAI.

[7]  Simon Colton,et al.  A Grand Challenge of Theorem Discovery , 2003 .

[8]  Piotr Rudnicki,et al.  An Overview of the MIZAR Project , 1992 .

[9]  Reiner Hähnle,et al.  Verification of Hardware Systems with First-Order Logic , 2002 .

[10]  M. Stickel,et al.  Automated reasoning and exhaustive search: Quasigroup existence problems☆ , 1995 .

[11]  Michael Kohlhase,et al.  System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning , 2002, CADE.

[12]  Jörg Denzinger,et al.  Recording and Analysing Knowledge-Based Distributed Deduction Processes , 1996, J. Symb. Comput..

[13]  Joachim Steinbach,et al.  SETHEO and E-SETHEO - The CADE-13 Systems , 2004, Journal of Automated Reasoning.

[14]  Andreas Meier.  System description : TRAMP transformation of machine-found proofs into natural deduction proofs at the assertion level , 2000 .

[15]  Richard Sommer,et al.  A Computer Environment for Writing Ordinary Mathematical Proofs , 2001, LPAR.

[16]  James A. Hendler,et al.  The Semantic Web" in Scientific American , 2001 .

[17]  John K. Slaney,et al.  FINDER: Finite Domain Enumerator - System Description , 1994, CADE.

[18]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[19]  Geoff Sutcliffe,et al.  Proving Harder Theorems by Axiom Reduction , 2003, FLAIRS.

[20]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[21]  Michael Kohlhase,et al.  OMDOC: Towards an Internet Standard for the Administration, Distribution, and Teaching of Mathematical Knowledge , 2000, AISC.

[22]  Stephan Schulz,et al.  Recording, Analyzing and Presenting Distributed Deduction Processes , 1994 .

[23]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

[24]  Jörg Denzinger,et al.  DISCOUNT - A Distributed and Learning Equational Prover , 2004, Journal of Automated Reasoning.

[25]  Armin Fiedler,et al.  P.rex: An Interactive Proof Explainer , 2001, IJCAR.

[26]  Larry Wos,et al.  A fascinating country in the world of computing: your guide to automated reasoning , 1999 .

[27]  Journal of automated reasoning , 1986 .

[28]  Christoph Weidenbach,et al.  Common Syntax of the DFG-Schwerpunktprogramm ''Deduktion'' , 1996 .

[29]  O. Caprotti,et al.  OpenMath and MathML: semantic markup for mathematics , 1999, CROS.

[30]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[31]  Ian Horrocks,et al.  Ontology Reasoning in the SHOQ(D) Description Logic , 2001, IJCAI.

[32]  William McCune,et al.  MACE 2.0 Reference Manual and Guide , 2001, ArXiv.