The TPTP Typed First-Order Form with Arithmetic

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.

[1]  C. Tinelli,et al.  The SMT-LIB Format: An Initial Proposal , 2003 .

[2]  William McCune,et al.  OTTER 3.3 Reference Manual , 2003, ArXiv.

[3]  G. Sutcliffe.  Proceedings of the 5th IJCAR ATP System Competition CASC-J5 , 2010 .

[4]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[5]  Peter Baumgartner,et al.  Model Evolution with equality - Revised and implemented , 2012, J. Symb. Comput..

[6]  Ernst Althaus,et al.  Superposition Modulo Linear Arithmetic SUP(LA) , 2009, FroCoS.

[7]  Christopher W. Brown.  QEPCAD B: a program for computing with semi-algebraic sets using CADs , 2003, SIGS.

[8]  Geoff Sutcliffe,et al.  The TPTP World - Infrastructure for Automated Reasoning , 2010, LPAR.

[9]  William Pugh,et al.  The Omega test: A fast and practical integer programming algorithm for dependence analysis , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[10]  John Harrison,et al.  Handbook of Practical Logic and Automated Reasoning , 2009 .

[11]  Christoph Walther,et al.  A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.

[12]  Manfred Schmidt-Schauß.  A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation , 1985, IJCAI.

[13]  Peter Baumgartner,et al.  (LIA) - Model Evolution with Linear Integer Arithmetic Constraints , 2008, LPAR.

[14]  Gerard de Melo,et al.  Progress Towards Effective Automated Reasoning with World Knowledge , 2010, FLAIRS.

[15]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[16]  Harald Ganzinger,et al.  Refutational theorem proving for hierarchic first-order theories , 1994, Applicable Algebra in Engineering, Communication and Computing.

[17]  G. Sutcliffe,et al.  Proceedings of the CADE-23 ATP System Competition CASC-23 , 2011 .

[18]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[19]  Geoff Sutcliffe.  The CADE-23 Automated Theorem Proving System Competition - CASC-23 , 2012, AI Commun..

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

[21]  Geoff Sutcliffe,et al.  THF0 - The Core of the TPTP Language for Higher-Order Logic , 2008, IJCAR.

[22]  A. G. Cohn,et al.  Many sorted logic=unsorted logic+control? , 1987 .

[23]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[24]  Lawrence C. Paulson,et al.  MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions , 2010, Journal of Automated Reasoning.

[25]  Philipp Rümmer,et al.  A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic , 2008, LPAR.

[26]  Geoff Sutcliffe.  The SZS Ontologies for Automated Reasoning Software , 2008, LPAR Workshops.

[27]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[28]  Joseph Y. Halpern.  Presburger arithmetic with unary predicates is Π11 complete , 1991, Journal of Symbolic Logic.

[29]  Raymond T. Boute,et al.  The Euclidean definition of the functions div and mod , 1992, TOPL.

[30]  Tobias Nipkow.  Linear Quantifier Elimination , 2008, IJCAR.

[31]  Clark W. Barrett,et al.  The SMT-LIB Standard Version 2.0 , 2010 .

[32]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.

[33]  K. Claessen,et al.  New Techniques that Improve MACE-style Finite Model Finding , 2007 .

[34]  Andrei Voronkov,et al.  Integrating Linear Arithmetic into Superposition Calculus , 2007, CSL.

[35]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[36]  Anthony G. Cohn,et al.  A more expressive formulation of many sorted logic , 1987, Journal of Automated Reasoning.