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

Page 277

For goal ( and subgoal ) expressions , we allow conjunctions of

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

For initial and intermediate state descriptions , we allow only conjunctions of ...

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

Page 278

straightforward : It follows if there are

of the precondition

mgu ' s have a unifying composition ) . If such a match can be found , we say that

...

straightforward : It follows if there are

**literals**among the facts that unify with eachof the precondition

**literals**and if all of the mgu ' s are consistent ( that is , if thesemgu ' s have a unifying composition ) . If such a match can be found , we say that

...

Page 288

Therefore , if a goal expression contains a

description that matches appropriate instances of the preconditions of that F - rule

, the ...

Therefore , if a goal expression contains a

**literal**, L , that unifies with one of the**literals**in the add list of an F - rule , then we know that if we produce a statedescription that matches appropriate instances of the preconditions of that F - rule

, the ...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

PROLOGUE | 1 |

PRODUCTION SYSTEMS AND AL | 17 |

SEARCH STRATEGIES FOR | 53 |

Copyright | |

12 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 backward block called chapter clauses CLEAR(C complete component condition conjunction consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed evaluation example expression F-rule fact Figure formula function given global database goal goal wff HANDEMPTY heuristic implication important initial instance involves JOHN knowledge labeled language literals logically 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 resolvent 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