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 49
Page 134
has value F. When an atomic formula contains variables , there may be some assignments to the variables ( of entities in the domain ) for which an atomic formula has value T and other assignments for which it has value F. 4.1.2 .
has value F. When an atomic formula contains variables , there may be some assignments to the variables ( of entities in the domain ) for which an atomic formula has value T and other assignments for which it has value F. 4.1.2 .
Page 136
QUANTIFICATION Sometimes an atomic formula , like P ( x ) , has value T ( with a given interpretation for P ) no matter what ... In the predicate calculus these properties are used in establishing the truth values of formulas containing ...
QUANTIFICATION Sometimes an atomic formula , like P ( x ) , has value T ( with a given interpretation for P ) no matter what ... In the predicate calculus these properties are used in establishing the truth values of formulas containing ...
Page 153
The formula CLEAR ( B ) is intended to mean that block B has a clear top ; that is , no other block is on it . The ON predicate is used to describe which blocks are ( directly ) on other blocks . ( For this example , ON is not ...
The formula CLEAR ( B ) is intended to mean that block B has a clear top ; that is , no other block is on it . The ON predicate is used to describe which blocks are ( directly ) on other blocks . ( For this example , ON is not ...
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
Bibliographic information
| Title | Principles of Artificial Intelligence |
| Author | Nils J. Nilsson |
| Edition | illustrated, reprint |
| Publisher | Morgan Kaufmann Publishers, 1986 |
| Original from | the University of Virginia |
| Digitized | 27 Jul 2009 |
| ISBN | 0934613109, 9780934613101 |
| Length | 476 pages |
| Subjects | › Reference / General |
| Export Citation | BiBTeX EndNote RefMan |