Thousands of Problems for Theorem Provers
From HandWiki - Reading time: 1 min
Short description: Collection of problems for Automated Theorem Proving
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". http://www.tptp.org/.
- ↑ 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. 5803. pp. 435–443. doi:10.1007/978-3-642-04617-9_55. ISBN 978-3-642-04616-2. https://www.researchgate.net/publication/221562903.
- ↑ Hurd, Joe (2003). First-Order Proof Tactics in Higher-Order Logic Theorem Provers.
- ↑ Segre, Alberto Maria; Sturgill, David B. (1994). "Using Hundreds of Workstations to Solve First-Order Logic Problems". AAAI-94 Proceedings.. https://www.aaai.org/Papers/AAAI/1994/AAAI94-029.pdf.
- ↑ 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. 5195. pp. 491–506. doi:10.1007/978-3-540-71070-7_41. ISBN 978-3-540-71069-1.
External links
 |  |
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Thousands_of_Problems_for_Theorem_Provers10 views | Status: cached on July 17 2024 03:44:34↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF