论文信息 - And-Or Graphs Applied to RUE Resolution

And-Or Graphs Applied to RUE Resolution

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.

V. S. Subrahmanian | James J. Lu | Vincent J. Digricoli

[1] Malcolm C. Harrison,et al. Equality-based binary resolution , 1986, JACM.

[2] W. W. Bledsoe,et al. Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[3] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[4] Nils J. Nilsson,et al. Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[5] James R. Slagle,et al. An Admissible and Optimal Algorithm for Searching AND/OR Graphs , 1971, Artif. Intell..