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 31
Nils J. Nilsson. satisfies the termination condition. Notice that we can use the distance chart of Figure 1.5 to compute the total distance for any trip. Any trip proposed as a solution must be of minimal distance. Figure 1.6 shows part ...
... termination condition. Part of a search tree for this problem is shown in Figure 1.7. In this simple example, aside from different possible orderings of rule applications, there is very little branching in the tree. 1.1.7. BACKWARD AND ...
... termination condition to be used by the control system (to decide when the problem is solved) must be stated as some type of matching condition between the state description part and the goal description part of the global database. The ...
... termination condition is that the database contain only Ms. Agraph-search control regime might explore many equivalent paths in producing a database containing only Ms. Two of these are shown in Figure 1.9. Redundant paths can lead to ...
... termination condition. That is, if we are to work on each component separately, we must be able to express the global termination condition using the termination conditions of each of the components. The most important case occurs when ...
Contents
1 | |
17 | |
CHAPTER 2 SEARCH STRATEGIES FOR AI PRODUCTION SYSTEMS | 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 |