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 33
... complete problems grows exponentially with problem size . It is not yet known whether faster methods ( involving only polynomial time , say ) exist , but it has been proven that if a faster method exists for one of the NP - complete ...
... complete chess and checker games , AND / OR search to termination is wholly out of the question . It has been estimated that the complete game tree for checkers has approximately 1040 nodes and the chess tree has approximately 10120 ...
... complete if its use results in a procedure that will find a contradiction ( eventually ) whenever one exists . ( The completeness of a strategy should not be confused with the logical completeness of an inference rule discussed in ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown