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

Page 206

The AND / OR graph

in leaf nodes and that include the newly added match arc . The clauses

corresponding to these solution graphs are : S ( A ) V X ( B ) V Q ( A , A ) and S ( A

) V X ...

The AND / OR graph

**shown in Figure**6 . 6 has two solution graphs that terminatein leaf nodes and that include the newly added match arc . The clauses

corresponding to these solution graphs are : S ( A ) V X ( B ) V Q ( A , A ) and S ( A

) V X ...

Page 281

Suppose our goal is the state

initial state description

unstack ( C , A ) are the only applicable F - rules . Figure 7 . 3 shows the complete

state ...

Suppose our goal is the state

**shown in Figure**7 . 2 . Working forward from theinitial state description

**shown in Figure**7 . 1 , we see that pickup ( B ) andunstack ( C , A ) are the only applicable F - rules . Figure 7 . 3 shows the complete

state ...

Page 342

... special explanation so we consider this general subject next . We begin our

discussion by considering another example . Suppose we are trying to achieve

the goal ( CLEAR ( A ) ^ HANDEMPTY ] from the initial state

... special explanation so we consider this general subject next . We begin our

discussion by considering another example . Suppose we are trying to achieve

the goal ( CLEAR ( A ) ^ HANDEMPTY ] from the initial state

**shown in Figure**7 .### 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