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
We cannot depict the entire search for a solution in the figure; it is too extensive. Eventually though, a solution path will be found, because all possible paths (of length less than 6) will be explored. Note that if the depth bound is ...
1.8 Critically discuss the following thesis: Backtracking (or depth-first graph-search) control strategies should be used when there are multiple paths between problem states because these strategies tend to avoid exploring all of the ...
5 R - FIRST(RULES); the best of the applicable rules is selected. ... Both of these cases can be arbitrarily prevented by imposing a depth bound on the recursion. Any recursive call fails ... 56 SEARCH STRATEGIES FOR AI PRODUCTION SYSTEMS.
In AI, we are typically not interested in uninformed procedures, but we describe two types here for purposes of comparison: depth-first search and breadth-first search. The first type of uninformed search orders the nodes on OPEN in ...
If the result is saved, then the goal test in step 5 need only look up the result instead of repeating a possibly costly computation.) The depth-first procedure generates new databases in an order similar to that generated by an ...
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 |