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 80
Page 63
... given node s , representing the initial database and another given node t , representing some other database . The more usual situation , though , involves finding a path between a node s and any member of a set of nodes { t ; } that ...
... given node s , representing the initial database and another given node t , representing some other database . The more usual situation , though , involves finding a path between a node s and any member of a set of nodes { t ; } that ...
Page 75
... given by k ( n , t , ) . We let h * ( n ) be the minimum of all of the k ( n , t ) over the entire set of goal nodes { t1 } . Thus , h * ( n ) is the cost of the minimal cost path from n to a goal node , and any path from node n to a ...
... given by k ( n , t , ) . We let h * ( n ) be the minimum of all of the k ( n , t ) over the entire set of goal nodes { t1 } . Thus , h * ( n ) is the cost of the minimal cost path from n to a goal node , and any path from node n to a ...
Page 122
... given a backed - up value , this value is computed . Now consider the situation occurring at that stage of the depth - first search immediately after node A and all of its successors have been generated , but before node B is generated ...
... given a backed - up value , this value is computed . Now consider the situation occurring at that stage of the depth - first search immediately after node A and all of its successors have been generated , but before node B is generated ...
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 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