Equality-based binary resolution
Vincent J. Digricoli, Malcolm C. Harrison · Journal of the ACM · 1986
A major event in automated reasoning was the introduction by Robinson of resolution as an inference principle that is complete for the first-order predicate calculus. Here the theory of binary resolution, based strictly on unification, is recast to incorporate the axioms of equality. Equality-based binary resolution is complete without making use of paramodulation and leads to refutations that are less than half as long as standard refutations with the equality axioms. A detailed discussion is given of the first major use of a theorem prover based on this new method.
Cited by 42 works. doi:10.1145/5383.5389 Open-access PDF
Authors
References
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- Proceedings of the 19th International Joint Conference on Artificial Intelligence
- Symbolic Logic and Mechanical Theorem Proving
- Unit Refutations and Horn Sets
- Automated Theorem Proving
- An algorithm for reasoning about equality
- E-Resolution: Extension of Resolution to Include the Equality Relation
- Problems and Experiments for and with Automated Theorem-Proving Programs
- A machine-oriented logic incorporating the equality relation