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
Page xi
... theorem proving , intelligent data retrieval systems , etc. The major difficulty with this approach is that these application areas are now so extensive , that each could , at best , be only superficially treated in a book of this ...
... theorem proving , intelligent data retrieval systems , etc. The major difficulty with this approach is that these application areas are now so extensive , that each could , at best , be only superficially treated in a book of this ...
Page 4
... THEOREM PROVING Finding a proof ( or disproof ) for a conjectured theorem in mathemat- ics can certainly be regarded as an intellectual task . Not only does it require the ability to make deductions from hypotheses but demands intuitive ...
... THEOREM PROVING Finding a proof ( or disproof ) for a conjectured theorem in mathemat- ics can certainly be regarded as an intellectual task . Not only does it require the ability to make deductions from hypotheses but demands intuitive ...
Page 5
... theorem proving programs have been developed that possess some of these same skills to a limited degree . The study of theorem proving has been significant in the development of AI methods . The formalization of the deductive process ...
... theorem proving programs have been developed that possess some of these same skills to a limited degree . The study of theorem proving has been significant in the development of AI methods . The formalization of the deductive process ...
Page 9
... 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 resolution systems and ...
... 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 resolution systems and ...
Page 10
... theorem proving . An introductory book by Jackson ( 1974 ) treats these problem - solving ideas and also describes applications to natural language processing and image analysis . The book by Hunt ( 1975 ) treats pattern recognition ...
... theorem proving . An introductory book by Jackson ( 1974 ) treats these problem - solving ideas and also describes applications to natural language processing and image analysis . The book by Hunt ( 1975 ) treats pattern recognition ...
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