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 50
Page 40
In the former mode , each component is processed to completion before
processing begins on the next . Of course , when a production rule is applied to a
component , a database may result that can itself be split . The components of
this ...
In the former mode , each component is processed to completion before
processing begins on the next . Of course , when a production rule is applied to a
component , a database may result that can itself be split . The components of
this ...
Page 297
If we work on the component goal ON ( B , C ) first , we easily find the solution
sequence { pickup ( B ) , stack ( B , C ) } . But if we apply this sequence , the state
of the world would change , so that a solution to the other component goal , ON (
A ...
If we work on the component goal ON ( B , C ) first , we easily find the solution
sequence { pickup ( B ) , stack ( B , C ) } . But if we apply this sequence , the state
of the world would change , so that a solution to the other component goal , ON (
A ...
Page 298
Otherwise , if the top goal in the goal stack is a compound goal , STRIPS adds
each of the component goal literals , in some order , above the compound goal in
the goal stack . The idea is that STRIPS works on each of these component goals
...
Otherwise , if the top goal in the goal stack is a compound goal , STRIPS adds
each of the component goal literals , in some order , above the compound goal in
the goal stack . The idea is that STRIPS works on each of these component goals
...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
SEARCH STRATEGIES FOR DECOMPOSABLE | 99 |
Copyright | |
10 other sections not shown
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 goal 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 search tree selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem tree 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 |