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 84
... Example 45 S dx 25x2 + 16 - 5 cot 0 csc 0 d0 using x = 16 Division of numerator by denominator Example z dz 1 S242 + S ( 22 - 1 + 1 + 23 ) dz z + 1 Completing the square + zł ) 1+ . Example tan 0 dx dx √ ( x2 - 4x + 13 ) 2 + ( ( x − 2 ) ...
... examples . A predicate symbol is used to represent a relation in a domain of discourse . Suppose , for example , that we wanted to represent the fact that someone wrote something . We might use the predicate symbol WRITE to denote a ...
... example , ON is not transitive ; it is intended to mean immediately on top . ) The formula ONTABLE ( B ) is intended to mean that B is somewhere on the table . The last formula in the list gives information about how CLEAR and ON are ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown