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 76
Page 34
In the 8 - puzzle , with a single initial state and a single goal state , it makes no
difference whether the problem is solved in the forward or the backward direction
. The computational effort is the same for both directions . There are occasions ...
In the 8 - puzzle , with a single initial state and a single goal state , it makes no
difference whether the problem is solved in the forward or the backward direction
. The computational effort is the same for both directions . There are occasions ...
Page 297
There seems no way to solve this problem by selecting one component , solving
it , and then solving the other component without undoing the solution to the first .
We say that the component goals of this problem interact . Solving one goal ...
There seems no way to solve this problem by selecting one component , solving
it , and then solving the other component without undoing the solution to the first .
We say that the component goals of this problem interact . Solving one goal ...
Page 316
The STRIPS problem - solving system is described in Fikes and Nilsson ( 1971 ) .
The version of STRIPS discussed in ... Ernst and Newell ( 1969 ) describe how
later versions of GPS solve a variety of problems . Ernst ( 1969 ) presents a
formal ...
The STRIPS problem - solving system is described in Fikes and Nilsson ( 1971 ) .
The version of STRIPS discussed in ... Ernst and Newell ( 1969 ) describe how
later versions of GPS solve a variety of problems . Ernst ( 1969 ) presents a
formal ...
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
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 |