Principles of Artificial Intelligence
A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, Principles of Artificial Intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used.
Principles of Artificial Intelligenceevolved from the author's courses and seminars at Stanford University and University of Massachusetts, Amherst, and is suitable for text use in a senior or graduate AI course, or for individual study.
Results 1-3 of 21
... first procedure generates new databases in an order similar to that generated by an uninformed backtracking control strategy . The correspondence would be exact if the graph - search ... breadth - first because expansion of nodes in the ...
... search tree ) , algorithm A is identical to breadth - first search . We claimed earlier that the breadth - first algorithm is guaranteed to find a minimal length path to a goal . We now show that if h is a lower bound on h * ( that is ...
... first search , 69-71 Breadth - first strategy , in resolution , 165-166 CANCEL relation , in theorem proving , 254-257 , 270 Candidate solution graph , 217-218 , 254 Checker - playing programs , references for , 128 Chess - playing ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown