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-5 of 49
... Algorithms 88 Measures of Performance 91 Bibliographical and Historical Remarks 94 Exercises 96 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS 99 Searching AND/OR Graphs 99 AO*: A Heuristic Search Procedure for AND/OR Graphs 103 ...
... algorithms [Barstow (1979)]. Rich and Shrobe (1979) describe a programmer's apprentice system for assisting a human programmer. The related topic of program verification is surveyed by London (1979).[See also the discussion by Constable ...
... PROCEDURE The basic production system algorithm for solving a problem like the 8-puzzle can be written in nondeterministic form as follows: Procedure PRODUCTION 1 DATA - initial database 2 until DATA 20 PRODUCTION SYSTEMS AND AI.
... algorithm [Markov (1954), Galler and Perlis (1970)] involves imposing an order on the replacement rules and using this order to decide which applicable rule to apply next. Newell and Simon (1972) use string-modifying production rules ...
... algorithm backtracks 22 times before finding a solution; even the very first rule applied must ultimately be taken back. A more efficient algorithm (with less backtracking) can be obtained if we use a more informed rule ordering. One ...
Contents
| 1 | |
| 17 | |
| 53 | |
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS | 99 |
CHAPTER 4 THE PREDICATE CALCULUS IN AI | 131 |
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS | 161 |
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS | 193 |
CHAPTER 7 BASIC PLANGENERATING SYSTEMS | 275 |
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS | 321 |
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS | 361 |
PROSPECTUS | 417 |
BIBLIOGRAPHY | 429 |
AUTHOR INDEX | 467 |
SUBJECT INDEX | 471 |