The TPTP World -- infrastructure for automated reasoning
From MaRDI portal
Publication:3066085
DOI10.1007/978-3-642-17511-4_1zbMATH Open1253.68292OpenAlexW1889418786MaRDI QIDQ3066085FDOQ3066085
Authors: Geoff Sutcliffe 
Publication date: 7 January 2011
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-17511-4_1
Recommendations
Cited In (21)
- GKC: a reasoning system for large knowledge bases
- JEFL: joint embedding of formal proof libraries
- The CADE-26 automated theorem proving system competition -- CASC-26
- TPTP, TSTP, CASC, etc.
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- Title not available (Why is that?)
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic
- The higher-order prover \textsc{Leo}-II
- Improving stateful premise selection with transformers
- Combining and automating classical and non-classical logics in classical higher-order logics
- The TPTP typed first-order form with arithmetic
- TPTP
- Theorem proving in large formal mathematics as an emerging AI field
- Fully reusing clause deduction algorithm based on standard contradiction separation rule
- The logic languages of the TPTP world
- Structure formation in large theories
- Theorem proving as constraint solving with coherent logic
- Hammer for Coq: automation for dependent type theory
- System description: GAPT 2.0
- Inductive theorem proving based on tree grammars
Uses Software
This page was built for publication: The TPTP World -- infrastructure for automated reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066085)
