Using the TPTP Language for Writing Derivations and Finite Interpretations
From MaRDI portal
Publication:3613401
DOI10.1007/11814771_7zbMath1222.68373OpenAlexW1584954960MaRDI QIDQ3613401
Stephan Schulz, Koen Claessen, Geoff Sutcliffe, Allen van Gelder
Publication date: 12 March 2009
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11814771_7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Teaching Automated Theorem Proving by Example: PyRes 1.2 ⋮ The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 ⋮ The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 ⋮ THF0 – The Core of the TPTP Language for Higher-Order Logic ⋮ The CADE-27 Automated theorem proving System Competition – CASC-27 ⋮ HOL(y)Hammer: online ATP service for HOL Light ⋮ Progress in the Development of Automated Theorem Proving for Higher-Order Logic ⋮ System Description: GAPT 2.0 ⋮ Faster, higher, stronger: E 2.3 ⋮ An Interactive Derivation Viewer ⋮ Panoptes ⋮ Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\)
Uses Software
This page was built for publication: Using the TPTP Language for Writing Derivations and Finite Interpretations
