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

Page 68

The resulting search procedure is called uninformed. In AI, we are typically not

interested in uninformed procedures, but we describe two types here for

purposes of comparison:

of ...

The resulting search procedure is called uninformed. In AI, we are typically not

interested in uninformed procedures, but we describe two types here for

purposes of comparison:

**depth**-**first search**and breadth-first search. The first typeof ...

Page 69

The

generated by an uninformed backtracking control strategy. The correspondence

would be exact if the graph-

time.

The

**depth**-**first**procedure generates new databases in an order similar to thatgenerated by an uninformed backtracking control strategy. The correspondence

would be exact if the graph-

**search**process generated only one successor at atime.

Page 122

Consider the

of this tree in Figure 3.11. Suppose that

manner and that whenever a tip node is generated, its static evaluation is ...

Consider the

**first**stage of the tic-tac-toe tree shown in Figure 3.8. We repeat partof this tree in Figure 3.11. Suppose that

**search**had progressed in a**depth**-**first**manner and that whenever a tip node is generated, its static evaluation is ...

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