The TPTP Typed First-Order Form with Arithmetic
From MaRDI portal
Publication:2891471
DOI10.1007/978-3-642-28717-6_32zbMath1352.68217OpenAlexW1592758987MaRDI QIDQ2891471
Koen Claessen, Stephan Schulz, Peter Baumgartner, Geoff Sutcliffe
Publication date: 15 June 2012
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28717-6_32
Related Items
A First Class Boolean Sort in First-Order Theorem Proving and TPTP, Generic Literals, Formal Logic Definitions for Interchange Languages, SMTtoTPTP – A Converter for Theorem Proving Formats, Beagle – A Hierarchic Superposition Theorem Prover, Aligning concepts across proof assistant libraries, Extensional higher-order paramodulation in Leo-III, Unnamed Item, The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0, Encoding Monomorphic and Polymorphic Types, First-order automated reasoning with theories: when deduction modulo theory meets practice, Scalable fine-grained proofs for formula processing, GRUNGE: a grand unified ATP challenge, Faster, higher, stronger: E 2.3, Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\)
Uses Software
