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 21
Boyer and Moore (1979) have developed a theorem-proving system that proves theorems about recursive functions and makes strong use of induction. Regular workshops are held on automatic deduction. An informal proceedings was issued for ...
A simple recursive procedure captures the essence of the operation of a production system under backtracking control. This procedure, which we call BACKTRACK, takes a single argument, DATA, initially set equal to the global database of ...
8 PATH – BACKTRACK(RDATA); BACKTRACK is called recursively on the new database. 9 if PATH = FAIL, go LOOP; if the recursive call fails, try another rule. 10 return CONS(R, PATH); otherwise, pass the successful list of rules up, ...
Any recursive call fails when its depth exceeds this bound. Cycling can be more straightforwardly prevented by maintaining a list of the databases produced so far and by checking new ones to see that they do not match any on the list.
In order to implement this backtracking strategy as a recursive procedure, the entire chain of databases must be an argument of the procedure. Again, practical implementations of AI backtracking production systems use various techniques ...
What people are saying - Write a review
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 |