ML Anthology

And-or Graphs Applied to RUE Resolution

Vincent J. Digricoli, James J. Lu, V. S. Subrahmanian
IJCAI 1989 pp. 354-358
/ijcai/1989/digricoli1989ijcai-graphs/

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.

PDF Semantic Scholar

Cite

Text

Digricoli et al. "And-or Graphs Applied to RUE Resolution." International Joint Conference on Artificial Intelligence, 1989.

Markdown

[Digricoli et al. "And-or Graphs Applied to RUE Resolution." International Joint Conference on Artificial Intelligence, 1989.](https://mlanthology.org/ijcai/1989/digricoli1989ijcai-graphs/)

BibTeX

@inproceedings{digricoli1989ijcai-graphs,
  title     = {{And-or Graphs Applied to RUE Resolution}},
  author    = {Digricoli, Vincent J. and Lu, James J. and Subrahmanian, V. S.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1989},
  pages     = {354-358},
  url       = {https://mlanthology.org/ijcai/1989/digricoli1989ijcai-graphs/}
}