The efficacy of rue resolution experimental results and heuristic theory

Authors:
Vincent J. Digrigoli
Affiliations:
Courant Institute of Mathematical Sciences, New York University and Hofstra University, Whitestone, New York
Venue:
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Year:
1981

Citing 7
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
The Concept of Demodulation in Theorem Proving

Journal of the ACM (JACM)
Another Generalization of Resolution

Journal of the ACM (JACM)
Hyperparamodulation: A Refinement of Paramodulation

Proceedings of the 5th Conference on Automated Deduction
Automatic deduction and equality

ACM '79 Proceedings of the 1979 annual conference
Problems and Experiments for and with Automated Theorem-Proving Programs

IEEE Transactions on Computers
Resolution, Refinements, and Search Strategies: A Comparative Study

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present and analyse experimental results in the first extensive use of a theorem prover based on Resolution by Unification and Equality. Implicit use is made of equality axioms by the Inference rules RUE and NRF to achieve incisive refutations for E-unsatisfiability. Since a primary issue in automated deduction is the efficiancy of convergence to proof, we describe in detail the heuristics which were used to obtain proofs. A comparative tabulation with the results of McCharen, Overbeek and Wos, who used unification resolution, shows sharply reduced cumulative unification counts.