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 46
Page vii
... Algorithms 88 Measures of Performance 91 Bibliographical and Historical Remarks 94 Exercises 96 CHAPTER 3 : SEARCH STRATegies for DeCOMPOSABLE 3.1 . 3.2 . 3.3 . 3.4 . 3.5 . PRODUCTION SYSTEMS 99 Searching AND / OR Graphs 99 AO * : A ...
... Algorithms 88 Measures of Performance 91 Bibliographical and Historical Remarks 94 Exercises 96 CHAPTER 3 : SEARCH STRATegies for DeCOMPOSABLE 3.1 . 3.2 . 3.3 . 3.4 . 3.5 . PRODUCTION SYSTEMS 99 Searching AND / OR Graphs 99 AO * : A ...
Page 14
... algorithms [ Barstow ( 1979 ) ] . Rich and Shrobe ( 1979 ) describe a programmer's apprentice system for assisting a human programmer . The related topic of program verification is surveyed by London ( 1979 ) . [ See also the discussion ...
... algorithms [ Barstow ( 1979 ) ] . Rich and Shrobe ( 1979 ) describe a programmer's apprentice system for assisting a human programmer . The related topic of program verification is surveyed by London ( 1979 ) . [ See also the discussion ...
Page 20
... PROCEDURE The basic production system algorithm for solving a problem like the 8 - puzzle can be written in nondeterministic form as follows : Procedure PRODUCTION 1 DATA + initial database 2 until DATA 20 PRODUCTION SYSTEMS AND AI.
... PROCEDURE The basic production system algorithm for solving a problem like the 8 - puzzle can be written in nondeterministic form as follows : Procedure PRODUCTION 1 DATA + initial database 2 until DATA 20 PRODUCTION SYSTEMS AND AI.
Page 48
... algorithm [ Markov ( 1954 ) , Galler and Perlis ( 1970 ) ] involves imposing an order on the replacement rules and using this order to decide which applicable rule to apply next . Newell and Simon ( 1972 ) use string - modi- fying ...
... algorithm [ Markov ( 1954 ) , Galler and Perlis ( 1970 ) ] involves imposing an order on the replacement rules and using this order to decide which applicable rule to apply next . Newell and Simon ( 1972 ) use string - modi- fying ...
Page 58
... algorithm backtracks 22 times before finding a solution ; even the very first rule applied must ultimately be taken back . A more efficient algorithm ( with less backtracking ) can be obtained if we use a more informed rule ordering ...
... algorithm backtracks 22 times before finding a solution ; even the very first rule applied must ultimately be taken back . A more efficient algorithm ( with less backtracking ) can be obtained if we use a more informed rule ordering ...
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