Principles of Artificial IntelligenceA 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. |
From inside the book
Results 1-3 of 91
... node has at most one parent . A node in the tree having no parent is called a root node . A node in the tree having no successors is called a tip node . We say that the root node is of depth zero . The depth of any other node in the ...
... node 1 is expanded , its single successor , node 2 , is generated . But node 2 , with parent node 3 in the search tree , had previously been generated , and node 2 is also on CLOSED with successor nodes 4 and 5. Note , however , that ...
... nodes B , C , and D can in no way affect what will turn out to be MAX's best first move . In this example , the search savings depended on the fact that node A represented a win for MIN . The same kind of savings can be achieved ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown