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

Page 101

The initial database

The initial database

**corresponds**to a distinguished node in the graph called the start node . The start node has an outgoing connector to a set of successor nodes**corresponding**to the components of the initial database ( if it can be ...Page 114

Nodes

Nodes

**corresponding**to MIN's next move have successors that are like AND nodes . From MAX's point of view , a solution ( that is , a win ) must be obtainable from all of these successors . Nodes**corresponding**to MAX's next move have ...Page 261

For F - rule programs , the pattern is the antecedent of the

For F - rule programs , the pattern is the antecedent of the

**corresponding**rule ; for B - rule programs , the pattern is the consequent . For simplicity , we assume that a pattern consists of a single literal only .### 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