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 50
Page 56
... step 1 ) only if it produces a database satisfying the termination condition . The list of rules used in producing this database is built up in step 10. Unsuccessful terminations can occur in steps 2 and 4. When an unsuccessful ...
... step 1 ) only if it produces a database satisfying the termination condition . The list of rules used in producing this database is built up in step 10. Unsuccessful terminations can occur in steps 2 and 4. When an unsuccessful ...
Page 65
... step 7. Each node ( except s ) in G has a pointer directed to just one of its parents in G , which defines its unique parent in T. Each possible path to a node discovered by the algorithm is preserved explicitly in G ; a single ...
... step 7. Each node ( except s ) in G has a pointer directed to just one of its parents in G , which defines its unique parent in T. Each possible path to a node discovered by the algorithm is preserved explicitly in G ; a single ...
Page 76
... step 3 or in step 5 . Notice that in every cycle through the loop of the algorithm , a node is removed from OPEN and that only a finite number of new successors are added to OPEN . For finite graphs , we ultimately run out of new ...
... step 3 or in step 5 . Notice that in every cycle through the loop of the algorithm , a node is removed from OPEN and that only a finite number of new successors are added to OPEN . For finite graphs , we ultimately run out of new ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
achieve actions algorithm AND/OR graph answer applied arcs Artificial Intelligence assume attempt backtracking backward block called chapter clause CLEAR CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed evaluation example expression F-rule fact Figure formula function given goal goal node goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals logic match methods move namely node Note obtained occur ONTABLE(A operation path possible precondition predicate calculus problem procedure production system proof prove quantified reasoning refutation represent representation resolution result robot rule satisfied selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem unifying unit University variables