## Principles of Artificial IntelligenceA 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 27

Page 153

The last formula in the list gives information about how CLEAR and ON are

related A

particular situation or “ world state . ” We call it a state description . Actually , any

finite ...

The last formula in the list gives information about how CLEAR and ON are

related A

**conjunction**of several such formulas can serve as a description of aparticular situation or “ world state . ” We call it a state description . Actually , any

finite ...

Page 181

... of the occurrence of the

this

clause ( none of the elements of this

.

... of the occurrence of the

**conjunction**[ B ( x ) ^ C ( x ) ] ; nevertheless , we treatthis

**conjunction**as a single literal and proceed formally as if the formula were aclause ( none of the elements of this

**conjunction**are ever in any unification sets ).

Page 277

For goal ( and subgoal ) expressions , we allow

any variables in goal expressions are assumed to have existential quantification .

For initial and intermediate state descriptions , we allow only

For goal ( and subgoal ) expressions , we allow

**conjunctions**of literals only , andany variables in goal expressions are assumed to have existential quantification .

For initial and intermediate state descriptions , we allow only

**conjunctions**of ...### 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

achieve actions algorithm AND/OR graph answer applied arcs Artificial Intelligence assume attempt backtracking backward block called chapter clause CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed efficient evaluation example expression F-rule fact Figure formula function given global database goal goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals logic match methods move namely node Note obtained occur ONTABLE(A operation path possible precondition predicate calculus problem procedure production system proof prove quantified reasoning refutation represent representation resolution result robot rule satisfied selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem unifying unit University variables