This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Hole in Goal Trees: Some Guidance from Resolution Theory
April 1976 (vol. 25 no. 4)
pp. 335-341
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.
Index Terms:
AND/OR trees, Geometry Theorem Machine, goal trees, model elimination, resolution, theorem proving.
Citation:
D.W. Loveland, M.E. Stickel, "A Hole in Goal Trees: Some Guidance from Resolution Theory," IEEE Transactions on Computers, vol. 25, no. 4, pp. 335-341, April 1976, doi:10.1109/TC.1976.1674614
Usage of this product signifies your acceptance of the Terms of Use.