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 81
Page 45
In Figure 1.13 we show an AND / OR tree that illustrates a possible search
performed by a decomposable production system . The problem is to integrate -
dx ( 1 – x2 ) 512 Algebraic substitutions Example Sizinyons - S } ( 36-42 + 4 ) da
using ...
In Figure 1.13 we show an AND / OR tree that illustrates a possible search
performed by a decomposable production system . The problem is to integrate -
dx ( 1 – x2 ) 512 Algebraic substitutions Example Sizinyons - S } ( 36-42 + 4 ) da
using ...
Page 132
Suppose , for example , that we wanted to represent the fact that someone wrote
something . We might use the predicate symbol WRITE to denote a relationship
between a person doing the writing and a thing written . We can compose a ...
Suppose , for example , that we wanted to represent the fact that someone wrote
something . We might use the predicate symbol WRITE to denote a relationship
between a person doing the writing and a thing written . We can compose a ...
Page 153
( For this example , ON is not transitive ; it is intended to mean immediately on top
. ) The formula ONTABLE ( B ) is intended to mean that B is somewhere on the
table . The last formula in the list gives information about how CLEAR and ON are
...
( For this example , ON is not transitive ; it is intended to mean immediately on top
. ) The formula ONTABLE ( B ) is intended to mean that B is somewhere on the
table . The last formula in the list gives information about how CLEAR and ON are
...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown
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 |