Problems and Experiments for and with Automated Theorem-Proving Programs
From MaRDI portal
Cited in
(21)- On solving the equality problem in theories defined by Horn clauses
- Hierarchical deduction
- Seventy-five problems for testing automatic theorem provers
- Experiments with resolution-based theorem-proving algorithms
- Uniform strategies: The CADE-11 theorem proving contest
- The problem of reasoning by case analysis
- The rue theorem-proving system: The complete set of LIM+ challenge problems
- A learning procedure for mathematics.
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- Retrieving geometric information from images: the case of hand-drawn diagrams
- Automated production of traditional proofs in solid geometry
- The anatomy of vampire. Implementing bottom-up procedures with code trees
- Automated production of traditional proofs for theorems in Euclidean geometry. I: The Hilbert intersection point theorems
- Larry Wos: visions of automated reasoning
- Set of support, demodulation, paramodulation: a historical perspective
- A review and prospect of readable machine proofs for geometry theorems
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- The TPTP problem library
- SLIM: An automated reasoner for equivalences, applied to set theory
- Stepping stones in the TPTP world
- A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
This page was built for publication: Problems and Experiments for and with Automated Theorem-Proving Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4095910)
