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

Page 134

has value F. When an atomic

assignments to the variables (of entities in the domain) for which an atomic

CONNECTIVES ...

has value F. When an atomic

**formula**contains variables, there may he. someassignments to the variables (of entities in the domain) for which an atomic

**formula**has value T and other assignments for which it has value X 4.12.CONNECTIVES ...

Page 153

The

no other block is on it. The ON predicate is ... A conjunction of several such

call it a ...

The

**formula**CLEAR(B) is intended to mean that block B has a clear top; that is,no other block is on it. The ON predicate is ... A conjunction of several such

**formulas**can serve as a description of a particular situation or "world state." Wecall it a ...

Page 278

We assume that all of the free variables in the delete list occur as (existentially

quantified) variables in the precondition

match instance of a delete list literal is a ground literal. The third component is the

...

We assume that all of the free variables in the delete list occur as (existentially

quantified) variables in the precondition

**formula**. This restriction ensures that anymatch instance of a delete list literal is a ground literal. The third component is the

...

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