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 55
G.) G2). 3 1 4 - 8|4 1 5 7| 6 || 5 7. |. : For the instance of the 8-puzzle in Figure 12, the. Fig. 1.2 Hill-climbing values for states of the 8-puzzle. Fig. 1.4A search tree for the 8-puzzle. 23 PRODUCTION SYSTEMS.
Suppose we decide to use a graph-search control regime in solving the 8-puzzle problem posed in Figure 1.1. We can keep track of the various rules applied and the databases produced by a structure called a search tree.
Z\ ^ - ZN A /\ ^ D: : Goal The processes required to represent problems initially and to improve. Fig. 1.4A search tree for the 8-puzzle. Fig. 1.6 A search tree for the traveling salesman problem.
Any global database beginning and ending with A and naming all of the other cities satisfies the termination condition. Notice that we can use the. Fig. 1.6 A search tree for the traveling salesman problem. Fig.
Figure 1.6 shows part of the search tree that might be generated by a graph-search control strategy in solving this problem. The numbers next to the edges of the tree are the increments of distance added to the trip by applying the ...
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 |