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 49
... goal node , the process terminates successfully . The successful path from start node to goal node can then be recovered ( in reverse ) by tracing the pointers ... node ( except the root node ) of a tree 65 GRAPH - SEARCH STRATEGIES.
... nodes having no path between them . ) The cost of a minimal cost path from node n to some particular goal node , t1 , is then given by k ( n , t ) . We let h * ( n ) be the minimum of all of the k ( n , t1 ) over the entire set of goal ...
... node s to a goal node . Both , of course , will terminate in an optimal path . We will show that , at termination , if node n in G was expanded by A ,, it was also expanded by A ,. Thus , A , always expands at least as many nodes as ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown