## 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 40

Page 75

That is,/(/i ) is an estimate of the

through node n. That node on OPEN having the smallest value of / is then the

node estimated to impose the least severe constraint; hence it is appropriate that

it be ...

That is,/(/i ) is an estimate of the

**cost**of a minimal**cost**path constrained to gothrough node n. That node on OPEN having the smallest value of / is then the

node estimated to impose the least severe constraint; hence it is appropriate that

it be ...

Page 102

nky, otherwise, there is no solution graph from n to N. Analogous to the use of arc

applications; again we need to assume that each

...

nky, otherwise, there is no solution graph from n to N. Analogous to the use of arc

**costs**in ordinary graphs, it is often ... (These**costs**model the**costs**of ruleapplications; again we need to assume that each

**cost**is greater than some small...

Page 106

newly computed

the estimated best "path" to terminal nodes. This revised

propagated upward in the graph. (Acyclicity of our graphs guarantees no loops in

this ...

newly computed

**costs**of its successors) and marks the outgoing connector onthe estimated best "path" to terminal nodes. This revised

**cost**estimate ispropagated upward in the graph. (Acyclicity of our graphs guarantees no loops in

this ...

### 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