Pages that link to "Item:Q2547495"
From MaRDI portal
The following pages link to Splitting and reduction heuristics in automatic theorem proving (Q2547495):
Displaying 19 items.
- Set theory in first-order logic: Clauses for Gödel's axioms (Q1097252) (← links)
- A structure-preserving clause form translation (Q1098330) (← links)
- Man-machine theorem proving in graph theory (Q1104124) (← links)
- MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics (Q1118426) (← links)
- A simplified problem reduction format (Q1170894) (← links)
- Complexity of resolution proofs and function introduction (Q1194246) (← links)
- A relaxation approach to splitting in an automatic theorem prover (Q1215411) (← links)
- Non-resolution theorem proving (Q1238434) (← links)
- Towards the automation of set theory and its logic (Q1253108) (← links)
- Automated theorem proving in mathematics. (Q1353941) (← links)
- Using tactics to reformulate formulae for resolution theorem proving (Q1380410) (← links)
- A man-machine theorem-proving system (Q1845619) (← links)
- Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
- A fully automatic theorem prover with human-style output (Q2362206) (← links)
- Splitting and reduction heuristics in automatic theorem proving (Q2547495) (← links)
- Computer proofs of limit theorems (Q2554244) (← links)
- The practicality of generating semantic trees for proofs of unsatisfiability (Q2710799) (← links)
- Automatic theorem proving. II (Q3793764) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
