And-Or Graphs Applied to RUE Resolution
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
Digricoli, V. J., Lu, J. J., & Subrahmanian, V. S. (1989). And-Or Graphs Applied to RUE Resolution. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 (pp. 354–357). IJCAI. https://ijcai.org/proceedings/1989/56
@inproceedings{ijcai1989p56,
title = {And-Or Graphs Applied to RUE Resolution},
author = {Digricoli, Vincent J. and Lu, James J. and Subrahmanian, V. S.},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {354--357},
year = {1989},
month = {8},
note = {Automated Deduction},
url = {https://ijcai.org/proceedings/1989/56},
}
TY - CPAPER TI - And-Or Graphs Applied to RUE Resolution AU - Digricoli, Vincent J. AU - Lu, James J. AU - Subrahmanian, V. S. T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 354 EP - 357 UR - https://ijcai.org/proceedings/1989/56 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: