Issue No. 04 - April (1976 vol. 25)
D.W. Loveland , Department of Computer Science, Duke University
The representation power of goal-subgoal trees and the adequacy of this form of problem reduction is considered. A number of inadequacies in the classical form are illustrated, and two versions of a syntactic procedure incorporating extensions are given. Although the form of the corrections are suggested from resolution theory results, and the value of this connection emphasized, the paper discusses the goal tree format and its extensions on an informal level.
AND/OR trees, Geometry Theorem Machine, goal trees, model elimination, resolution, theorem proving.
M. Stickel and D. Loveland, "A Hole in Goal Trees: Some Guidance from Resolution Theory," in IEEE Transactions on Computers, vol. 25, no. , pp. 335-341, 1976.