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 38
Page 40
... labeled by global databases . Nodes labeled by compound databases have sets of successor nodes each labeled by one of the components . These successor nodes are called AND nodes because in order to process the compound database to ...
... labeled by global databases . Nodes labeled by compound databases have sets of successor nodes each labeled by one of the components . These successor nodes are called AND nodes because in order to process the compound database to ...
Page 164
... labeled by clauses ; initially , there is a node for every clause in the base set . When two clauses , c , and c ,, produce a resolvent , ri ,, we create a new node , labeled r1 ,, with edges linking it to both the c , and c , nodes ...
... labeled by clauses ; initially , there is a node for every clause in the base set . When two clauses , c , and c ,, produce a resolvent , ri ,, we create a new node , labeled r1 ,, with edges linking it to both the c , and c , nodes ...
Page 215
... 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 ...
... 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 | |
10 other sections not shown
Other editions - View all
Common terms and phrases
8-puzzle achieve actions Adders AI production 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 CONT(Y,A contains control regime control strategy cost Deleters delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge literal nodes logic monotone restriction natural language processing negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree selected 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 universally quantified unstack(C,A variables WORKS-IN