TPTP and TSTP Quick Guide
tptp.org · 379 words · saved by 1 readers
These are hard test problems. If you solve any of these then either your system is very good, or your system is unsound.
The TPTP Language The TPTP Language: Quick look, All the details How to write problems How to write derivations How to write interpretations The language grammar in BNF The SZS ontology for problem and solution status The TPTP Problem Library The TPTP (Thousands of Problems for Theorem Provers) is a library of test problems for ATP systems. The WWW page is tptp.tptp.org You can browse the TPTP problems online. Here is a series of fun examples using the various logic languages of the TPTP World. Sample problems in CNF, FOF, TFF TFA TXF, THF, NTF The TSTP Solution Library…
saved by
related reading
- TPTPtptp.org
- Type theory - Wikipediaen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- P versus NP problem - Wikipediaen.wikipedia.org
- GitHub - srush/Tensor-Puzzles: Solve puzzles. Improve your pytorch.github.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Eat. Sleep. Math.eatsleepmath.tumblr.com
- Reasons to believescottaaronson.blog
- True quantified Boolean formula - Wikipediaen.wikipedia.org
- P vs. NP for Dummiesscottaaronson.blog
- Context-free grammar - Wikipediaen.wikipedia.org
- Complexity class - Wikipediaen.wikipedia.org