A new hyperparamodulation strategy for the equality relation

Authors:
Younghwan Lim;Lawrence J. Henschen
Affiliations:
Department of EE, CS, Northwestern University, Evanston;Department of EE, CS, Northwestern University, Evanston
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 7
Cited 0

The Concept of Demodulation in Theorem Proving

Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
Another Generalization of Resolution

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Hyperparamodulation: A Refinement of Paramodulation

Proceedings of the 5th Conference on Automated Deduction
Logic Machine Architecture: Kernel Funtions

Proceedings of the 6th Conference on Automated Deduction
Semantic paramodulation for horn sets (logic, equality, theorem-proving)

Semantic paramodulation for horn sets (logic, equality, theorem-proving)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Equality is an Important relation and many theorems can be easily symbolized through it's use. A proposed Inference rule called HL-resolution is intended to have the benefits of hyper steps while controlling the application of paramodulation. It generates a resolvent by building a paramodulation and demodulation link between two terms using a pre proceased plan as a guide. The rule is complete for E-unsatisfiable Horn sets. The linking process makes use of an equality graph which is constructed once at the beginning of the run. Once a pair of candidate terms for HL-resolutlon is chosen in the search, potential linkages can be found and tested for compatibility efficiently by looking at the paths in the graph. The method was implemented on an existing theorem-proving system. A number of experiments were conducted on problems in abstract algebra and a comparison with set-of-support paramodulation was made.