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

Page 11

Nilsson's ( 1974 ) survey describes the field in the early 1970s and

Nilsson's ( 1974 ) survey describes the field in the early 1970s and

**contains**many references . Michie's ( 1974 ) book**contains**several of his articles on AI . Raphael's ( 1975 ) book and Winston's ( 1977 ) book are easy - to - read and ...Page 206

The rule is applicable if the AND / OR graph

The rule is applicable if the AND / OR graph

**contains**a literal node L ' that unifies with L. Suppose the mgu is u . Then , application of this rule extends the graph ( just as in the propositional calculus case ) by creating a match ...Page 288

Therefore , if a goal expression

Therefore , if a goal expression

**contains**a literal , L , that unifies with one of the literals in the add list of an ... by a backward application of an F - rule must certainly**contain**instances of the preconditions of that F - rule .### 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