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 74
Page 277
... literals ( i.e. , literals without variables ) . The formulas in Figure 7.1 clearly satisfy these restrictions . 7.1.2 . MODELING ROBOT ACTIONS Robot actions change one state , or configuration , of the world into another . We can model ...
... literals ( i.e. , literals without variables ) . The formulas in Figure 7.1 clearly satisfy these restrictions . 7.1.2 . MODELING ROBOT ACTIONS Robot actions change one state , or configuration , of the world into another . We can model ...
Page 278
... literals and if all of the mgu's are consistent ( that is , if these mgu's have a unifying composition ) . If such a ... literals ( possibly containing free variables ) called the delete list . When an F - rule is applied to a state ...
... literals and if all of the mgu's are consistent ( that is , if these mgu's have a unifying composition ) . If such a ... literals ( possibly containing free variables ) called the delete list . When an F - rule is applied to a state ...
Page 289
Nils J. Nilsson. literals . ) Let R [ Q ; Fu ] be the regression of a literal Q through a ground instance Fu of an F - rule ... literals ; otherwise , it is Q itself . Regressing expressions through incompletely instantiated F - rules is ...
Nils J. Nilsson. literals . ) Let R [ Q ; Fu ] be the regression of a literal Q through a ground instance Fu of an F - rule ... literals ; otherwise , it is Q itself . Regressing expressions through incompletely instantiated F - rules is ...
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