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 25
Page 99
... label given to a node in an AND / OR tree depends upon that node's relation to its parent . In one case , a parent node labeled by a compound database has a set of AND successor nodes , each labeling one of the component databases . In ...
... label given to a node in an AND / OR tree depends upon that node's relation to its parent . In one case , a parent node labeled by a compound database has a set of AND successor nodes , each labeling one of the component databases . In ...
Page 164
... nodes in such a graph are labeled by clauses ; initially , there is a node for every clause in the base set . When two clauses , c , and c ,, produce a resolvent , r ,, we create a new node , labeled r1 ,, with edges linking it to both ...
... nodes in such a graph are labeled by clauses ; initially , there is a node for every clause in the base set . When two clauses , c , and c ,, produce a resolvent , r ,, we create a new node , labeled r1 ,, with edges linking it to both ...
Page 215
... node labeled by L ' that unifies with L. The result of applying the rule is to add a match arc from the node labeled by L ' to a new descendant node labeled by L. This new node is the root node of the AND / OR graph representation of Wu ...
... node labeled by L ' that unifies with L. The result of applying the rule is to add a match arc from the node labeled by L ' to a new descendant node labeled by L. This new node is the root node of the AND / OR graph representation of Wu ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
12 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 global database goal 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