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

CHAPTER 5

6, we are primarily concerned with systems that prove theorems in the predicate

calculus. Our interest in theorem proving is not limited to applications in ...

CHAPTER 5

**RESOLUTION REFUTATION**SYSTEMS In this chapter and chapter6, we are primarily concerned with systems that prove theorems in the predicate

calculus. Our interest in theorem proving is not limited to applications in ...

Page 163

PRODUCTION SYSTEMS FOR

system for producing

database is a set of clauses, and the rule schema is resolution. Instances of this ...

PRODUCTION SYSTEMS FOR

**RESOLUTION REFUTATIONS**We can think of asystem for producing

**resolution refutations**as a production system. The globaldatabase is a set of clauses, and the rule schema is resolution. Instances of this ...

Page 190

5.2 Indicate which of the following clauses are subsumed by P (f( x ),y ): (a) P(f(A),

f(x))V P(z,f(y)) (b) P(z,A)V ~P(A,z) (c) P(f(f(x)),z) (d) P(f(z),z)V Q(x) (e) P(A,A)V P(f(

x\y) S3 Show by a

5.2 Indicate which of the following clauses are subsumed by P (f( x ),y ): (a) P(f(A),

f(x))V P(z,f(y)) (b) P(z,A)V ~P(A,z) (c) P(f(f(x)),z) (d) P(f(z),z)V Q(x) (e) P(A,A)V P(f(

x\y) S3 Show by a

**resolution refutation**that each of the following formulas is a ...### 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