E-resolution: extension of resolution to include the equality relation

Authors:
James B. Morris
Affiliations:
Department of Computer Science, The University of Texas at Austin
Venue:
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Year:
1969

Citing 4
Cited 1

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

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

Journal of the ACM (JACM)
Resolution With Merging

Journal of the ACM (JACM)

The management of heuristic search in boolean experiments with RUE resolution

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The E-Resolution inference principle described in this paper is a single-inference logic system for the first-order predicate calculus with equality. Special axioms for equality (i.e., axioms for symmetry, reflexivity, transitivity, and substituti - vity) are not required to be added to the original set of clauses. Other advantages of E-Resolution are the relatively small number of intermediate clauses which must be retained in a proof and the distinct possibility that search strategies suitable for Resolution will also be suitable for E-Resolution.Although it is not known whether or not E-Resolution is complete, this topic is currently being investigated by the author.