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

Page 147

Nils J. Nilsson. the

the existential quantifier altogether and write ( Vy ) P [ 8 ( y ) , y ) . The general

rule for eliminating an existential quantifier from a wff is to replace each

occurrence ...

Nils J. Nilsson. the

**Skolem function**in place of the x that exists , we can eliminatethe existential quantifier altogether and write ( Vy ) P [ 8 ( y ) , y ) . The general

rule for eliminating an existential quantifier from a wff is to replace each

occurrence ...

Page 184

What is to be the interpretation of these

eventually appear as terms in the answer ... Let the clause form of the axioms be :

C ( x , p ( x ) ) , meaning “ For all x , x is the child of p ( x ) ” ( that is , p is a function

...

What is to be the interpretation of these

**Skolem functions**if they shouldeventually appear as terms in the answer ... Let the clause form of the axioms be :

C ( x , p ( x ) ) , meaning “ For all x , x is the child of p ( x ) ” ( that is , p is a function

...

Page 185

regardless of the

wft ) , we are able to prove P ( P ( A ) , A ) ... it is correct to replace any

variables .

regardless of the

**Skolem function**A ( hypothesized to spoil the validity of the goalwft ) , we are able to prove P ( P ( A ) , A ) ... it is correct to replace any

**Skolem****functions**in the clauses coming from the negation of the goal wff by newvariables .

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