DocumentCode
1132358
Title
A Hole in Goal Trees: Some Guidance from Resolution Theory
Author
Loveland, Donald W. ; Stickel, Mark E.
Author_Institution
Department of Computer Science, Duke University
Issue
4
fYear
1976
fDate
4/1/1976 12:00:00 AM
Firstpage
335
Lastpage
341
Abstract
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.
Keywords
AND/OR trees, Geometry Theorem Machine, goal trees, model elimination, resolution, theorem proving.; Computer science; Geometry; Logic; Organizing; Power measurement; Problem-solving; Search methods; Solid modeling; Stress; Vocabulary; AND/OR trees, Geometry Theorem Machine, goal trees, model elimination, resolution, theorem proving.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1976.1674614
Filename
1674614
Link To Document