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 45
Page xii
... discussed at the end of every chapter . These citations should provide the interested student with adequate entry points to much of the most important literature in the field . I look forward someday to revising this book - to correct ...
... discussed at the end of every chapter . These citations should provide the interested student with adequate entry points to much of the most important literature in the field . I look forward someday to revising this book - to correct ...
Page 6
... discussed in this book . A classical example is the traveling salesman's problem , where the problem is to find a minimum distance tour , starting at one of several cities , visiting each city precisely once , and returning to the ...
... discussed in this book . A classical example is the traveling salesman's problem , where the problem is to find a minimum distance tour , starting at one of several cities , visiting each city precisely once , and returning to the ...
Page 9
... 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 resolution systems and describes some alternatives , called ...
... 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 resolution systems and describes some alternatives , called ...
Page 14
... discussed early in the history of computing by Goldstine and von Neumann ( 1947 ) and by Turing ( 1950 ) . Program verification was mentioned by McCarthy ( 1962 ) as one of the applications of a proposed mathematical science of ...
... discussed early in the history of computing by Goldstine and von Neumann ( 1947 ) and by Turing ( 1950 ) . Program verification was mentioned by McCarthy ( 1962 ) as one of the applications of a proposed mathematical science of ...
Page 48
... discussed in this book . Production systems derive from a computational formalism proposed by Post ( 1943 ) that was based on string replacement rules . The closely related idea of a Markov algorithm [ Markov ( 1954 ) , Galler and ...
... discussed in this book . Production systems derive from a computational formalism proposed by Post ( 1943 ) that was based on string replacement rules . The closely related idea of a Markov algorithm [ Markov ( 1954 ) , Galler and ...
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 |
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