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

Page 62

Certain pairs of nodes are connected by

one member of the pair to the other . ... If an

; , then node n ; is said to be a successor of node ni , and node n ; is said to be a ...

Certain pairs of nodes are connected by

**arcs**, and these**arcs**are directed fromone member of the pair to the other . ... If an

**arc**is directed from node ni to node n; , then node n ; is said to be a successor of node ni , and node n ; is said to be a ...

Page 63

We see that the problem of finding a sequence of rules transforming one

database into another is equivalent to the problem of finding a path in a graph .

Often it is convenient to assign positive costs to

applying the ...

We see that the problem of finding a sequence of rules transforming one

database into another is equivalent to the problem of finding a path in a graph .

Often it is convenient to assign positive costs to

**arcs**, to represent the cost ofapplying the ...

Page 370

The predicates EQ , EL , and SS can be represented by

leaves the node representing the first argument , and the head of the

the node representing the second argument . Thus , the expression EL ( GI ...

The predicates EQ , EL , and SS can be represented by

**arcs**; the tail of the**arc**leaves the node representing the first argument , and the head of the

**arc**entersthe node representing the second argument . Thus , the expression EL ( GI ...

### What people are saying - Write a review

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

### Contents

PROLOGUE | 1 |

PRODUCTION SYSTEMS AND AL | 17 |

SEARCH STRATEGIES FOR | 53 |

Copyright | |

12 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 backward block called chapter clauses CLEAR(C complete component condition conjunction consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed evaluation example expression F-rule fact Figure formula function given global database goal goal wff HANDEMPTY heuristic implication important initial instance involves JOHN knowledge labeled language literals logically 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 resolvent 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