## 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 Intelligence"evolved 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 51

Page 35

8 demonstrates that the same database , namely SG , is achieved regardless of

the

system is commutative if it has the following properties with respect to any ...

8 demonstrates that the same database , namely SG , is achieved regardless of

the

**sequence**of rules applied in the set { R1 , R2 , R3 } . We say that a productionsystem is commutative if it has the following properties with respect to any ...

Page 284

If there are N F - rules in the plan

row . The entries in cell ( ij ) of the table , for j > 0 and i < N + 1 , are those literals

added to the state description by the j - th F - rule that survive as preconditions of

...

If there are N F - rules in the plan

**sequence**, then the last row is the ( N + 1 ) - throw . The entries in cell ( ij ) of the table , for j > 0 and i < N + 1 , are those literals

added to the state description by the j - th F - rule that survive as preconditions of

...

Page 323

Rather , that part of the goal stack above the marker indicates the

rules applied so far . From this

compute what the state description would be if this

...

Rather , that part of the goal stack above the marker indicates the

**sequence**of F -rules applied so far . From this

**sequence**of F - rules , RSTRIPS can alwayscompute what the state description would be if this

**sequence**were applied to the...

### 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 assertions 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 expanded expression F-rule fact Figure formula function given global database goal goal node goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals 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 unifying unit universal variables