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 83
Page 153
We can always eliminate some of these interpretations by adding additional
formulas to the state description ; for ... Even though a finite conjunction of
formulas describes a family of states , we often loosely speak of the state
described by the ...
We can always eliminate some of these interpretations by adding additional
formulas to the state description ; for ... Even though a finite conjunction of
formulas describes a family of states , we often loosely speak of the state
described by the ...
Page 155
Note that this goal formula certainly cannot be proved as a theorem from the state
description for Figure 4 . 1 . The robot must change the state to one that can be
described by a set of formulas from which the goal wff can be proved . Problems ...
Note that this goal formula certainly cannot be proved as a theorem from the state
description for Figure 4 . 1 . The robot must change the state to one that can be
described by a set of formulas from which the goal wff can be proved . Problems ...
Page 365
First , an EL predicate is used to state that the object described by the unit is a
member of some set . ( If the object described by the unit had been a set itself ,
then an SS predicate would have been used to state that it was a subset of some
...
First , an EL predicate is used to state that the object described by the unit is a
member of some set . ( If the object described by the unit had been a set itself ,
then an SS predicate would have been used to state that it was a subset of some
...
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 efficient evaluation example expression F-rule fact Figure formula function given 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
Bibliographic information
| Title | Principles of Artificial Intelligence Symbolic computation |
| Author | Nils J. Nilsson |
| Edition | illustrated |
| Publisher | Tioga Publishing Company, 1980 |
| Original from | the University of Michigan |
| Digitized | 15 Nov 2007 |
| ISBN | 0935382011, 9780935382013 |
| Length | 476 pages |
| Export Citation | BiBTeX EndNote RefMan |