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 43
Page 155
have a “ robot - type " problem in which the system must find a sequence of robot
actions that change a configuration of blocks . We can specify the goal by a wff
that describes the set of states acceptable as goal states . Referring to Figure 4.1
...
have a “ robot - type " problem in which the system must find a sequence of robot
actions that change a configuration of blocks . We can specify the goal by a wff
that describes the set of states acceptable as goal states . Referring to Figure 4.1
...
Page 275
Robot problem solving and automatic programming are two domains in which
these kinds of problems occur . 7.1 . ROBOT PROBLEM SOLVING Research on
robot problem solving has led to many of our ideas about problem solving
systems .
Robot problem solving and automatic programming are two domains in which
these kinds of problems occur . 7.1 . ROBOT PROBLEM SOLVING Research on
robot problem solving has led to many of our ideas about problem solving
systems .
Page 276
The action synthesis part of the robot problem can be solved by a production
system . The global database is a description of the situation , or state , of the
world in which the robot finds itself , and the rules are computations representing
the ...
The action synthesis part of the robot problem can be solved by a production
system . The global database is a description of the situation , or state , of the
world in which the robot finds itself , and the rules are computations representing
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 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 |