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 43
... selected exercises as a basis for class discussion. Pertinent references are briefly discussed at the end of every chapter. These citations should provide the interested student with adequate entry points to much of the most important ...
... selected instead of the countless others that might have been used? The strategy of making hypotheses about various levels of description and then testing these hypotheses seems to offer an approach to this problem. Systems have been ...
... selected in step 4 has a good chance of being the most appropriate one. We distinguish two major kinds of control strategies: irrevocable and tentative. In an irrevocable control regime, an applicable rule is selected and applied ...
Nils J. Nilsson. when a rule is selected. Should subsequent computation encounter difficulty in producing a solution, the state of the computation reverts to the previous backtracking point, where another rule is applied instead, and the ...
... selected (arbitrarily) that does not diminish the value. If there are no such rules, the process halts. |. €3). @. 2 | 8 2 1 1 7 7. : #. : 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.
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 |