The TPTP typed first-order form with arithmetic
Paper i proceeding, 2012
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.
Theorem proving
Automata theory
Automated theorem proving
First order logic
First-order form
Artificial intelligence
Författare
G. Sutcliffe
University of Miami
S. Schulz
Technische Universitat Munchen
Koen Lindström Claessen
Chalmers, Data- och informationsteknik, Programvaruteknik
P. Baumgartner
Australian National University
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 7180 406-419978-364228716-9 (ISBN)
Ämneskategorier (SSIF 2011)
Programvaruteknik
DOI
10.1007/978-3-642-28717-6_32
ISBN
978-364228716-9