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 164
The nodes in such a graph are labeled by clauses; initially, there is a node for
every clause in the base set. When two clauses, cj and ct, produce a resolvent,
rth we create a new node, labeled rjy, with edges linking it to both the ct and c,
nodes ...
The nodes in such a graph are labeled by clauses; initially, there is a node for
every clause in the base set. When two clauses, cj and ct, produce a resolvent,
rth we create a new node, labeled rjy, with edges linking it to both the ct and c,
nodes ...
Page 215
Such a B - rule is applicable to an AND / OR graph representing a goal wff if that
graph contains a literal node labeled by L ' that unifies with L . The result of
applying the rule is to add a match arc from the node labeled by L ' to a new ...
Such a B - rule is applicable to an AND / OR graph representing a goal wff if that
graph contains a literal node labeled by L ' that unifies with L . The result of
applying the rule is to add a match arc from the node labeled by L ' to a new ...
Page 373
2 are all labeled by constant symbols . We can also accommocate variable nodes
; these are labeled by lower case letters near the end of the alphabet ( e . g . , . . . ,
x , y , z ) . Again , the variables are standardized apart and are assumed to be ...
2 are all labeled by constant symbols . We can also accommocate variable nodes
; these are labeled by lower case letters near the end of the alphabet ( e . g . , . . . ,
x , y , z ) . Again , the variables are standardized apart and are assumed to be ...
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 |