Proceedings

And-Or Graphs Applied to RUE Resolution

Download BibTeX Cite

Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 354-357.

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 non-termination of the viability test by applying the theory of And-Or graphs.

Vincent J. Digricoli, James J. Lu, and V. S. Subrahmanian. 1989. And-Or Graphs Applied to RUE Resolution. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89. IJCAI, 354–357. https://ijcai.org/proceedings/1989/56
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards