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 74
Page xii
... results and points of view . Toward that end , I solicit correspondence from readers . Nils J. Nilsson ACKNOWLEDGEMENTS Several organizations supported and encouraged the research , teach- xii theoretical material is added , the time ...
... results and points of view . Toward that end , I solicit correspondence from readers . Nils J. Nilsson ACKNOWLEDGEMENTS Several organizations supported and encouraged the research , teach- xii theoretical material is added , the time ...
Page 6
... result is closely related to the task of proving that a given program achieves a stated result . The latter is called program verification . Many automatic programming systems produce a verification of the output program as an added ...
... result is closely related to the task of proving that a given program achieves a stated result . The latter is called program verification . Many automatic programming systems produce a verification of the output program as an added ...
Page 11
... results of this research are described in papers by Medress et al . ( 1977 ) , and Klatt ( 1977 ) ; reports by Reddy et al . ( 1977 ) , Woods , et al ( 1976 ) , and Bernstein ( 1976 ) ; and a book edited by Walker ( 1978 ) . A ...
... results of this research are described in papers by Medress et al . ( 1977 ) , and Klatt ( 1977 ) ; reports by Reddy et al . ( 1977 ) , Woods , et al ( 1976 ) , and Bernstein ( 1976 ) ; and a book edited by Walker ( 1978 ) . A ...
Page 13
... results with resolution - based systems [ McCharen et al . ( 1976 ) ; Winker and Wos ( 1978 ) ; Winker ( 1979 ) ] . Boyer and Moore ( 1979 ) have developed a theorem - proving system that proves theorems about recursive functions and ...
... results with resolution - based systems [ McCharen et al . ( 1976 ) ; Winker and Wos ( 1978 ) ; Winker ( 1979 ) ] . Boyer and Moore ( 1979 ) have developed a theorem - proving system that proves theorems about recursive functions and ...
Page 21
... result of applying R to DATA end 1.1.3 . CONTROL The above procedure is nondeterministic because we have not yet specified precisely how we are going to select an applicable rule in statement 4. Selecting rules and keeping track of ...
... result of applying R to DATA end 1.1.3 . CONTROL The above procedure is nondeterministic because we have not yet specified precisely how we are going to select an applicable rule in statement 4. Selecting rules and keeping track of ...
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