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

Page 45

13 we show an AND / OR tree that illustrates a possible search performed by a

decomposable production system . The problem is to integrate 1 ( 1 – x2 ) 5 / 2 *

2 ) 517 az Algebraic substitutions

13 we show an AND / OR tree that illustrates a possible search performed by a

decomposable production system . The problem is to integrate 1 ( 1 – x2 ) 5 / 2 *

2 ) 517 az Algebraic substitutions

**Example**x ? dx ( 2 + 3x ) 43 ( 26 - 423 + 4 ) dz ...Page 290

In the present

of unstack ( B , C ) , and the other would contain the uninstantiated precondition

of unstack ( B , y ) conjoined with the literal ~ ( y = C ) . A related complication ...

In the present

**example**, one subgoal expression would contain the preconditionof unstack ( B , C ) , and the other would contain the uninstantiated precondition

of unstack ( B , y ) conjoined with the literal ~ ( y = C ) . A related complication ...

Page 370

Thus , in our

LAW . ... For

the structure : C G C JOHN ) giver A collection of predicate calculus expressions

of ...

Thus , in our

**examples**above , we would have nodes for JOHN , GI , MARY ,LAW . ... For

**example**, to represent the formula EQ [ giver ( G1 ) , JOHN ) , we usethe structure : C G C JOHN ) giver A collection of predicate calculus expressions

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