Principios de inteligencia artificialA 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 16
Page 75
We let h*(n) be the minimum 0f~ all of the k(n,tt) over the entire set of goal nodes {
tt } . 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 goal node that achieves h *( n ) is an optimal path from
...
We let h*(n) be the minimum 0f~ all of the k(n,tt) over the entire set of goal nodes {
tt } . 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 goal node that achieves h *( n ) is an optimal path from
...
Page 77
Next we would like to show that if a path from s to a goal node exists, A* will
terminate even for infinite graphs. ... (Recall that g *( n ) is the cost of the optimal
path from s to n, and that g(n) is the cost of the path in the search tree from j to
node n.
Next we would like to show that if a path from s to a goal node exists, A* will
terminate even for infinite graphs. ... (Recall that g *( n ) is the cost of the optimal
path from s to n, and that g(n) is the cost of the path in the search tree from j to
node n.
Page 78
But the f* value of any node on an optimal path is equal to f*(s), the minimal cost,
and therefore f(n')< f*(s). Thus, we have: RESULT 2: At any time before A*
terminates, there exists on OPEN a node ri that is on an optimal path from s to a
goal ...
But the f* value of any node on an optimal path is equal to f*(s), the minimal cost,
and therefore f(n')< f*(s). Thus, we have: RESULT 2: At any time before A*
terminates, there exists on OPEN a node ri that is on an optimal path from s to a
goal ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
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 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 control regime control strategy cost DCOMP delete delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem game tree global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic implication initial state description knowledge leaf nodes literal nodes logic methods negation node labeled ONTABLE(A optimal path precondition predicate calculus problem-solving procedure production rules production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications rule-based deduction systems search graph search tree semantic network sequence shown in Figure Skolem function solution graph solve STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes unifying composition universally quantified WORKS-IN
Bibliographic information
| Title | Principios de inteligencia artificial Symbolic computation |
| Author | Nils J. Nilsson |
| Edition | illustrated |
| Publisher | Díaz de Santos, 1980 |
| Original from | the University of Michigan |
| Digitized | 15 Nov 2007 |
| ISBN | 0935382011, 9780935382013 |
| Length | 476 pages |
| Subjects | › Computers / Intelligence (AI) & Semantics |
| Export Citation | BiBTeX EndNote RefMan |