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 6-10 of 35
... ), So we retract the next-to the-last move also and apply “move blank down” to State . Continuation is in the next column. Fig. 1.3A backtracking control strategy applied to the 8-puzzle. 26 PRODUCTION SYSTEMS AND AI.
... backtracking regime does not maintain the entire search tree structure; it merely keeps track of the path that it is working on currently, modifying it when necessary. 1.1.5. PROBLEMS OF REPRESENTATION Efficient problem solution ...
... backtracking strategy for making rule selections is used in conjunction with this fixed-order strategy for processing components. More flexible control strategies for decomposable production systems allow the component databases to be ...
... ascent) or minimum (steepest descent) of a function. See Athans et al. (1974, pp. 126ff) for a discussion. In computer science, Golomb and Baumert (1965) suggested backtracking as 49 BIBLIOGRAPHICAL AND HISTORICAL REMARKS.
... backtracking as a selection mechanism. Various AI programming languages use backtracking as a built-in search strategy [Bobrow and Raphael (1974)]. The literature on heuristic graph searching is extensive; several references are cited ...
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 |