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

Page 19

The

any kind of data structure can be used to describe states . These include symbol

strings , vectors , sets , arrays , trees , and lists . Sometimes , as in the 8 - puzzle ...

The

**initial**global database is this description of the**initial**problem state . Virtuallyany kind of data structure can be used to describe states . These include symbol

strings , vectors , sets , arrays , trees , and lists . Sometimes , as in the 8 - puzzle ...

Page 58

Using this ordering relation , the rules that are applicable to the

would be ordered as follows : ( R12 , R19 , R11 , R16 ) . The reader might verify

that this ordering scheme solves the 4 - queens problem with only 2 backtracks .

Using this ordering relation , the rules that are applicable to the

**initial**databasewould be ordered as follows : ( R12 , R19 , R11 , R16 ) . The reader might verify

that this ordering scheme solves the 4 - queens problem with only 2 backtracks .

Page 358

1 Starting with the

RSTRIPS would achieve the goal ( ON ( B , A ) A ON ( C , B ) ] . 8 . 2 Use any of

the plan generating systems described in chapters 7 and 8 to solve the following

block ...

1 Starting with the

**initial**state description shown in Figure 7 . 1 , show howRSTRIPS would achieve the goal ( ON ( B , A ) A ON ( C , B ) ] . 8 . 2 Use any of

the plan generating systems described in chapters 7 and 8 to solve the following

block ...

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