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 56
Page 17
... operations , and control . That is , if these systems are described at an appropriate level , one can often identify a ... operation of many Al systems . The major elements of an AI production system are a global database , a set of ...
... operations , and control . That is , if these systems are described at an appropriate level , one can often identify a ... operation of many Al systems . The major elements of an AI production system are a global database , a set of ...
Page 105
... operations . First , a top - down , graph - growing operation ( steps 4-6 ) finds the best partial solution graph by tracing down through the marked connectors . These ( previously computed ) marks indicate the current best partial ...
... operations . First , a top - down , graph - growing operation ( steps 4-6 ) finds the best partial solution graph by tracing down through the marked connectors . These ( previously computed ) marks indicate the current best partial ...
Page 196
... operation is also possible . The details about rule operation and termination are explained in the next few pages . This sort of theorem - proving system is a direct system rather than a refutation system . A direct system is not ...
... operation is also possible . The details about rule operation and termination are explained in the next few pages . This sort of theorem - proving system is a direct system rather than a refutation system . A direct system is not ...
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