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

Page 19

The

The

**initial**global database is this description of the**initial**problem state . Virtually any kind of data structure can be used to describe states . These include symbol strings , vectors , sets , arrays , trees , and lists .Page 58

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

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

**initial**database would be ordered as follows : ( R 12 , R13 , R11 , R1 ) . The reader might verify that this ordering scheme solves the 4 - queens problem with only 2 ...Page 308

This formula- tion involved one set of assertions that described the

This formula- tion involved one set of assertions that described the

**initial**state and another set that described the effects of the various robot actions on states . To keep track of which facts were true in which state , Green ...### 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 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 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