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

Page 141

We can represent any

We can represent any

**substitution**by a set of ordered pairs s = { 1 / Vse 1 : / Vg , ... , in vn ] . The pair 4 / v means that term t ... The**substitutions**used above in obtaining the four instances of P ( x , f ( y ) , B ] are ...Page 208

The notions of a consistent set of

The notions of a consistent set of

**substitutions**and a unifying composition of**substitutions**are defined as follows . Suppose we have a set of**substitutions**, { 41 , Ugr . . „ , Un } . Each ur is , in turn , a set of pairs : Ui = { tu ...Page 239

These variables are those for which

These variables are those for which

**substitution**inconsistencies were detected in the first proof attempt . Comparing Figure 6.24 and ... We can sometimes avoid multiplying out into clause form by using conditional**substitutions**.### What people are saying - Write a review

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

### 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 global database goal goal node 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