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

Page 35

After

resulting databases ; after

database , namely SG , is achieved regardless of the sequence of rules

in the ...

After

**applying**any one of these rules , all three rules are still applicable to theresulting databases ; after

**applying**any pair ... 8 demonstrates that the samedatabase , namely SG , is achieved regardless of the sequence of rules

**applied**in the ...

Page 278

We call the unifying composition, the match substitution. For a given F-rule and

state description, there may be many match substitutions. Each leads to a

different instance of F-rule that can be

rule is a ...

We call the unifying composition, the match substitution. For a given F-rule and

state description, there may be many match substitutions. Each leads to a

different instance of F-rule that can be

**applied**. The second component of the F-rule is a ...

Page 324

tion achieved after

stage, RSTRIPS notes that both of the preconditions for stack(C,£) are satisfied,

so this F-rule is

the ...

tion achieved after

**applying**unstack(C,v4 ). Regressing CLEAR(B) ... At thisstage, RSTRIPS notes that both of the preconditions for stack(C,£) are satisfied,

so this F-rule is

**applied**(by moving the marker), and ON(C,B) is protected. [Sincethe ...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

PRODUCTION SYSTEMS AND AI | 17 |

SEARCH STRATEGIES FOR | 53 |

SEARCH STRATEGIES FOR DECOMPOSABLE | 99 |

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 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 search tree selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem tree unifying unit University variables