Affiliation:
1. Department of Computer Science , University of Miami, Coral Gables, Florida, 33146, USA
Abstract
AbstractThe Thousands of Problems for Theorem Provers (TPTP) World is a well-established infrastructure that supports research, development and deployment of automated theorem proving systems. This paper provides an overview of the logic languages of the TPTP World, from classical first-order form (FOF), through typed FOF, up to typed higher-order form, and beyond to non-classical forms. The logic languages are described in a non-technical way and are illustrated with examples using the TPTP language.
Publisher
Oxford University Press (OUP)
Reference42 articles.
1. Basic paramodulation and superposition;Bachmair,1992
2. Resolution theorem proving;Bachmair,2001
3. Superposition for full higher-order logic;Bentkamp;Proceedings of the 28th International Conference on Automated Deduction,2021
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献