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 53
... 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 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 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 ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown