A Proof Method for Quantification Theory: Its Justification and Realization
From MaRDI portal
Cited in
(24)- First order Stålmarck. Universal lemmas through branch merges
- Automated theorem proving methods
- On the role of unification in mechanical theorem proving
- Structured proof procedures
- The Multi-SAT algorithm
- A posthumous contribution by Larry Wos: excerpts from an unpublished column
- Wanted: collaborative intelligence
- An examination of the geometry theorem machine
- Theorem proving with variable-constrained resolution
- Beweisalgorithmen für die Prädikatenlogik
- What is essential unification?
- DPLL: the core of modern satisfiability solvers
- History and prospects for first-order automated deduction
- scientific article; zbMATH DE number 3696535 (Why is no real title available?)
- The strategy challenge in SMT solving
- Semantically guided first-order theorem proving using hyper-linking
- John McCarthy's legacy
- On proof retrieval: Problem-solving machines, I
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
- How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse; A Case Study
- Martin Davis: an overview of his work in logic, computer science, and philosophy
- Learning guided automated reasoning: a brief survey
- Universal truth of operator statements via ideal membership
- Group cancellation and resolution
This page was built for publication: A Proof Method for Quantification Theory: Its Justification and Realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3275827)
