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 76
Page 100
... Note that node no has a 1 - connector directed to successor n , and a 2 - connector directed to the set of successors { n , n5 } . For k > 1 , k - connectors are denoted in our illustrations by a curved line joining the arcs from parent ...
... Note that node no has a 1 - connector directed to successor n , and a 2 - connector directed to the set of successors { n , n5 } . For k > 1 , k - connectors are denoted in our illustrations by a curved line joining the arcs from parent ...
Page 169
... Note that the first level of Figure 5.4 is the same as the first level of Figure 5.2 . At subsequent levels , the linear - input form strategy does reduce the number of clauses produced . Again , the use of this strategy on our example ...
... Note that the first level of Figure 5.4 is the same as the first level of Figure 5.2 . At subsequent levels , the linear - input form strategy does reduce the number of clauses produced . Again , the use of this strategy on our example ...
Page 231
Nils J. Nilsson. Examining the facts supporting this proof , we note some redundancy that could have been avoided by use of the transitive property of G. That is , from C > E and E > 0 , we ought to be able to derive C > 0 when needed ...
Nils J. Nilsson. Examining the facts supporting this proof , we note some redundancy that could have been avoided by use of the transitive property of G. That is , from C > E and E > 0 , we ought to be able to derive C > 0 when needed ...
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 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 methods 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