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 47
Page 63
... arcs , to represent the cost of applying the corresponding rule . We use the notation c ( n¡ , n , ) to denote the cost of an arc directed from node n , to node n ,. It will be important in some of our later arguments to assume that ...
... arcs , to represent the cost of applying the corresponding rule . We use the notation c ( n¡ , n , ) to denote the cost of an arc directed from node n , to node n ,. It will be important in some of our later arguments to assume that ...
Page 394
Nils J. Nilsson. belongs . In Figure 9.20 we show , by dashed arcs , some of the possible a arcs that the matcher is permitted to seek . If it can find such an arc , the match is successful . Unless all of the goal arcs can be matched ...
Nils J. Nilsson. belongs . In Figure 9.20 we show , by dashed arcs , some of the possible a arcs that the matcher is permitted to seek . If it can find such an arc , the match is successful . Unless all of the goal arcs can be matched ...
Page 397
... arcs labeled al , a2 , ak , respectively . The situation is depicted in Figure 9.23 . The constant nodes N1 , . . . , Nk also have other arcs incident on them . Our attempt to find a match must look back through al arcs incident on N1 , a2 ...
... arcs labeled al , a2 , ak , respectively . The situation is depicted in Figure 9.23 . The constant nodes N1 , . . . , Nk also have other arcs incident on them . Our attempt to find a match must look back through al arcs incident on N1 , a2 ...
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 DCOMP 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 leaf nodes literal nodes logic negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production system proof prove recursive regress represent representation result robot problem rule applications search graph search tree selected semantic network sequence shown in Figure Skolem function solution graph solve SRI International stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes universally quantified unstack(C,A variables WORKS-IN