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
Page 6
... described as a " super- compiler , " or a program that could take in a very high - level description of what the program is to accomplish and produce a program . The high - level description might be a precise statement in a formal ...
... described as a " super- compiler , " or a program that could take in a very high - level description of what the program is to accomplish and produce a program . The high - level description might be a precise statement in a formal ...
Page 9
... described . Systems for proving theorems using resolution are discussed in chapter 5. We indicate how several different kinds of problems can be posed as theorem - proving problems . Chapter 6 examines some of the inadequacies of simple ...
... described . Systems for proving theorems using resolution are discussed in chapter 5. We indicate how several different kinds of problems can be posed as theorem - proving problems . Chapter 6 examines some of the inadequacies of simple ...
Page 11
... described in a book by Winograd ( 1972 ) . The book by Newell et al . ( 1973 ) describes the five - year goals of a research project to develop a speech understanding system ; the major results of this research are described in papers ...
... described in a book by Winograd ( 1972 ) . The book by Newell et al . ( 1973 ) describes the five - year goals of a research project to develop a speech understanding system ; the major results of this research are described in papers ...
Page 12
... described by Duda et al . ( 1978a , 1978b , 1979 ) . Several expert systems developed at Stanford University are summarized by Feigen- baum ( 1977 ) . The most highly developed of these , DENDRAL , computes structural descriptions of ...
... described by Duda et al . ( 1978a , 1978b , 1979 ) . Several expert systems developed at Stanford University are summarized by Feigen- baum ( 1977 ) . The most highly developed of these , DENDRAL , computes structural descriptions of ...
Page 13
... described in several papers and reports . Good accounts are available for the MIT work by Winston ( 1972 ) ; for the Stanford Research Institute work by Raphael et al . ( 1971 ) and Raphael ( 1976 , chapter 8 ) ; for the Stanford ...
... described in several papers and reports . Good accounts are available for the MIT work by Winston ( 1972 ) ; for the Stanford Research Institute work by Raphael et al . ( 1971 ) and Raphael ( 1976 , chapter 8 ) ; for the Stanford ...
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 |
Other editions - View all
Common terms and phrases
8-puzzle achieve actions Adders algorithm AND/OR graph applied Artificial Intelligence atomic formula backed-up value backtracking backward block breadth-first breadth-first search called chapter clause form CLEAR(C component contains control regime control strategy cost DCOMP Deleters delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem game tree global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge leaf nodes literal nodes logic methods monotone restriction negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production rules production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree semantic network sequence shown in Figure Skolem function solution graph solve stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes unifying composition universally quantified