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 18
... delete list . When an F - rule is applied to a state description , the match substitution is applied to the literals in the delete list ; and the ground instances thus obtained are deleted from the old state description as the first ...
... delete list contain identical literals . In our example , we have chosen to include only HOLDING ( x ) in the add formula rather than , additionally , the negations of literals in the delete list . For our purposes , it will suffice ...
... delete C1 , and that are not ancestors of rule j in the graph nor rule j itself . This set is called the deleters of C1 . Any deleter of C1 , might ( as an F - rule ) destroy this precondition for F - rule j ; thus the order in which ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown