A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
Journal of the ACM (JACM)
Equality reasoning in clause graphs
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
Since their introduction in 1965, resolution based deductive systems for the first-order predicate calculus have been extensively investigated and utilized by researchers in the field of automatic theorem-proving by computer. Part of this research has been directed at finding techniques for treating the equality relation within the framework of resolution based deductive systems. Perhaps the most natural treatment of equality, introduced so far, is by means of the para-modulation principle which when used in conjunction with resolution forms a complete deductive system for the first-order predicate calculus with equality. A very similar technique for treating equality was introduced and called E-resolution. In fact E-resolution can be viewed as a restricted form of paramodulation and resolution. The purpose of this paper is to define E-resolution in terms of paramodulation and resolution and to prove the completeness of E-resolution and several modifications of E-resolution.