TPTP (Thousands of Problems for Theorem Provers) [1] is a freely available collection of problems for automated theorem proving. It is used to evaluate the efficacy of automated reasoning algorithms. [2] [3] [4] Problems are expressed in a simple text-based format for first order logic or higher-order logic. [5] TPTP is used as the source of some problems in CASC.
References
- ^ "The TPTP Problem Library for Automated Theorem Proving".
- ^ Hoder, Kryštof; Voronkov, Andrei (2009). "Comparing Unification Algorithms in First-Order Theorem Proving". KI 2009: Advances in Artificial Intelligence. Lecture Notes in Computer Science. Vol. 5803. pp. 435–443. CiteSeerX 10.1.1.329.1809. doi: 10.1007/978-3-642-04617-9_55. ISBN 978-3-642-04616-2.
-
^ Hurd, Joe (2003). "First-Order Proof Tactics in Higher-Order Logic Theorem Provers".
S2CID
11201048.
{{ cite journal}}: Cite journal requires|journal=( help) - ^ Segre, Alberto Maria; Sturgill, David B. (1994). "Using Hundreds of Workstations to Solve First-Order Logic Problems" (PDF). AAAI-94 Proceedings.
- ^ Benzmüller, Christoph; Rabe, Florian; Sutcliffe, Geoff (2008). "THF0 – The Core of the TPTP Language for Higher-Order Logic". Automated Reasoning. Lecture Notes in Computer Science. Vol. 5195. pp. 491–506. doi: 10.1007/978-3-540-71070-7_41. ISBN 978-3-540-71069-1.
External links
 | This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |