## 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 Intelligence evolved 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 94

Page 48

The knowledge about a problem that is represented in the global database is sometimes

The knowledge about a problem that is represented in the global database is sometimes

**called**declarative knowledge . In an intelligent information retrieval system , for example , the declarative knowledge would include the main ...Page 134

Formulas built by connecting other formulas by Vs are

Formulas built by connecting other formulas by Vs are

**called**disjunctions , and each of the component formulas is**called**a disjunct . Any disjunction composed of wffs is also a wff . The truth values of conjunctions and disjunctions are ...Page 135

A formula built by connecting two formulas with a → is

A formula built by connecting two formulas with a → is

**called**an implication . The left - hand side of an implication is**called**the antecedent , and the right - hand side is**called**the consequent . If both the antecedent and the ...### 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 assertions assume attempt backtracking backward block called chapter clause CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database Deleters described direction discussed efficient evaluation example expanded 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 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 search tree selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination unifying unit universal variables