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 90
Page 61
For example , in Figure 2.3 we show an initial database , DB1 , to which rules R1 and R2 , say , are applicable ; suppose the control system selects and applies R1 producing database DB2 ; then suppose the control system selects ...
For example , in Figure 2.3 we show an initial database , DB1 , to which rules R1 and R2 , say , are applicable ; suppose the control system selects and applies R1 producing database DB2 ; then suppose the control system selects ...
Page 241
For example , suppose the input to a program is denoted by the variable " x , " and the output is denoted by the variable " y . " Now suppose that we want to synthesize a program such that the relationship P holds between input and ...
For example , suppose the input to a program is denoted by the variable " x , " and the output is denoted by the variable " y . " Now suppose that we want to synthesize a program such that the relationship P holds between input and ...
Page 289
Suppose the F - rule is unstack , given earlier and repeated here : unstack ( x , y ) P & D : HANDEMPTY , CLEAR ( x ) , ON ( x , y ) A : HOLDING ( x ) , CLEAR ( y ) In particular , suppose we are considering the instance unstack ( B ...
Suppose the F - rule is unstack , given earlier and repeated here : unstack ( x , y ) P & D : HANDEMPTY , CLEAR ( x ) , ON ( x , y ) A : HOLDING ( x ) , CLEAR ( y ) In particular , suppose we are considering the instance unstack ( B ...
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
8-puzzle achieve actions Adders AI production algorithm AND/OR graph applied Artificial Intelligence atomic formula backed-up value backtracking backward block breadth-first breadth-first search called chapter clause form CLEAR(C component contains control regime control strategy cost DCOMP Deleters delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge leaf nodes literal nodes monotone restriction negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus procedure production system prove recursive regress represent representation resolution refutation result robot problem rule applications rule-based deduction systems search graph search tree semantic network sequence shown in Figure Skolem function solution graph solve stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes unifying composition universally quantified unstack(C,A WORKS-IN
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 |
| Export Citation | BiBTeX EndNote RefMan |