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 70
Page 334
... rule application . Often , we can find a more constrained partial ordering ... F - rules , because DCOMP assumes no interactions . A consistent solution ... F - rules from which they stem , because we will be referring to various ...
... rule application . Often , we can find a more constrained partial ordering ... F - rules , because DCOMP assumes no interactions . A consistent solution ... F - rules from which they stem , because we will be referring to various ...
Page 336
... F - rule j ; thus the order in which deleters occur relative to F - rule j is important . If the deleter is a descendant of rule j in the graph , we have special problems . ( We are not concerned about rule j itself or any of its ...
... F - rule j ; thus the order in which deleters occur relative to F - rule j is important . If the deleter is a descendant of rule j in the graph , we have special problems . ( We are not concerned about rule j itself or any of its ...
Page 338
... F - rule 5 and F - rule 4. Or if F - rule 2 occurs before F - rule 4 and after any deleters of this CLEAR ( A ) condition , we eliminate F - rule 5 entirely since CLEAR ( A ) is added by F - rule 2 . DCOMP attempts to render the phase 1 ...
... F - rule 5 and F - rule 4. Or if F - rule 2 occurs before F - rule 4 and after any deleters of this CLEAR ( A ) condition , we eliminate F - rule 5 entirely since CLEAR ( A ) is added by F - rule 2 . DCOMP attempts to render the phase 1 ...
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