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 14
Page 65
... tip nodes of the search tree , and the nodes on CLOSED are the nontip nodes . More precisely , at step 3 of the ... node ( except the root node ) of a tree 65 GRAPH SEARCH STRATEGIES.
... tip nodes of the search tree , and the nodes on CLOSED are the nontip nodes . More precisely , at step 3 of the ... node ( except the root node ) of a tree 65 GRAPH SEARCH STRATEGIES.
Page 116
... tip nodes , he would choose that node having the largest evaluation . Therefore , the ( MAX node ) parent of MIN tip nodes is assigned a backed - up value equal to the maximum of the evaluations of the tip nodes . On the other hand , if ...
... tip nodes , he would choose that node having the largest evaluation . Therefore , the ( MAX node ) parent of MIN tip nodes is assigned a backed - up value equal to the maximum of the evaluations of the tip nodes . On the other hand , if ...
Page 126
... tip nodes . If this tip node could be reached first in a depth - first search , the number of cutoffs would be maximal . When the number of cutoffs is maximal , a minimal number of tip nodes need to be generated and evaluated . Suppose ...
... tip nodes . If this tip node could be reached first in a depth - first search , the number of cutoffs would be maximal . When the number of cutoffs is maximal , a minimal number of tip nodes need to be generated and evaluated . Suppose ...
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