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

Page 208

The notions of a consistent set of substitutions and a

substitutions are defined as follows . Suppose we have a set of substitutions , (

U1 , U2 , ... , Un } . Each u ; is , in turn , a set of pairs : { tu / vil , ... , lim ( 1 ) / Vim ( 1

) ...

The notions of a consistent set of substitutions and a

**unifying**composition ofsubstitutions are defined as follows . Suppose we have a set of substitutions , (

U1 , U2 , ... , Un } . Each u ; is , in turn , a set of pairs : { tu / vil , ... , lim ( 1 ) / Vim ( 1

) ...

Page 217

We show a consistent solution graph for this problem in Figure 6.10 . The fact

nodes are shown double - boxed , and rule applications are labeled by the rule

number . To verify the consistency of this solution graph , we compute the

We show a consistent solution graph for this problem in Figure 6.10 . The fact

nodes are shown double - boxed , and rule applications are labeled by the rule

number . To verify the consistency of this solution graph , we compute the

**unifying**...Page 239

The

substitution { ( if ~ S ( A , B ) , B / y , B / x ) } . Since either S ( A , B ) or ~ S ( A , B )

must be true , we can combine these two solutions into one , with the

The

**unifying**composition of the substitutions in the graph the right includes thesubstitution { ( if ~ S ( A , B ) , B / y , B / x ) } . Since either S ( A , B ) or ~ S ( A , B )

must be true , we can combine these two solutions into one , with the

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