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-3 of 45
Page 40
... component is processed to completion before processing begins on the next . Of course , when a production rule is applied to a component , a database may result that can itself be split . The components of this database are processed in ...
... component is processed to completion before processing begins on the next . Of course , when a production rule is applied to a component , a database may result that can itself be split . The components of this database are processed in ...
Page 297
... component goal , ON ( B , C ) , would be harder to solve . There seems no way to solve this problem by selecting one component , solving it , and then solving the other compo- nent without undoing the solution to the first . We say that ...
... component goal , ON ( B , C ) , would be harder to solve . There seems no way to solve this problem by selecting one component , solving it , and then solving the other compo- nent without undoing the solution to the first . We say that ...
Page 298
... component goals in the order in which they appear on the stack . When all of the component goals are solved , it reconsiders the compound goal again , re - listing the components on the top of the stack if the compound goal does not ...
... component goals in the order in which they appear on the stack . When all of the component goals are solved , it reconsiders the compound goal again , re - listing the components on the top of the stack if the compound goal does not ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
achieve actions algorithm AND/OR graph answer applied arcs Artificial Intelligence assume attempt backtracking backward block called chapter clause CLEAR CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed evaluation example expression F-rule fact Figure formula function given goal goal node goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals logic match methods move namely node Note obtained occur ONTABLE(A operation path possible precondition predicate calculus problem procedure production system proof prove quantified reasoning refutation represent representation resolution result robot rule satisfied selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem unifying unit University variables