And-Or graphs applied to RUE resolution

Authors:
Vincent J. Digricoli;James J. Lu;V. S. Subrahmanian
Affiliations:
Dept. of Computer Science, Fordham University, Bronx, New York;Dept. of Computer Science, Syracuse University, Syracuse, New York;Dept. of Computer Science, Syracuse University, Syracuse, New York
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Year:
1989

Citing 3
Cited 0

Equality-based binary resolution

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In equality-based binary resolution, the viability test is used as a decision mechanism to select disagreement sets and also to define the RUE unifier. In this paper we solve the problem of nontermination of the viability test by applying the theory of And-Or graphs.