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 19
... regress HANDEMPTY through this F - rule instance , we would obtain F. ( The literal HANDEMPTY can never be true immediately after applying unstack . ) If we were to regress ON- TABLE ( C ) , we would obtain ONTABLE ( C ) . ( The ...
... regress through P unchanged ( so that it can be achieved by F - rule 1 ) . The structure of the solution that we are ... regresses through unstack ( C , A ) to T , with the substitution { C / x } . Furthermore , CLEAR ( A ) ...
... regress through a strict sequence ( as in this last example ) , the process is straightforward , but how are conditions to be regressed through a partial ordering ? Some conditions may regress through to conditions that match Adders : 1 ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown