Principios de inteligencia artificialA 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 17
Page 289
Let R [ Q ; Fu ] be the regression of a literal Q through a ground instance Fu of an
F-rule with precondition, P, delete list, D, and add list, A . Then, if Qu is a literal in
Au, R[Q;Fu] = r(True) else, if is a literal in Du, R[Q;Fu] = F (False) else, R[Q;Fu] ...
Let R [ Q ; Fu ] be the regression of a literal Q through a ground instance Fu of an
F-rule with precondition, P, delete list, D, and add list, A . Then, if Qu is a literal in
Au, R[Q;Fu] = r(True) else, if is a literal in Du, R[Q;Fu] = F (False) else, R[Q;Fu] ...
Page 290
We could summarize this result by saying that CLEAR ( C) regresses to the
disjunction (y = C) V CLEAR(C). ... A related complication occurs when we
regress an expression matching an incompletely instantiated literal in the delete
list.
We could summarize this result by saying that CLEAR ( C) regresses to the
disjunction (y = C) V CLEAR(C). ... A related complication occurs when we
regress an expression matching an incompletely instantiated literal in the delete
list.
Page 347
Its subgoal, HOLDING(C), regresses through unstack( C,A ) to T. Furthermore, all
of the conditions of node 2 [except HANDEMPTY, which is achieved by putdown(
C)] regress unchanged through putdown(C). Now, we can consider the problem ...
Its subgoal, HOLDING(C), regresses through unstack( C,A ) to T. Furthermore, all
of the conditions of node 2 [except HANDEMPTY, which is achieved by putdown(
C)] regress unchanged through putdown(C). Now, we can consider the problem ...
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 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 delete delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem game tree global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic implication initial state description knowledge leaf nodes literal nodes logic methods negation node labeled ONTABLE(A optimal path precondition predicate calculus problem-solving procedure production rules production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications rule-based deduction systems search graph search tree selected semantic network sequence shown in Figure Skolem function solution graph solve STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes unifying composition universally quantified unstack WORKS-IN
Bibliographic information
| Title | Principios de inteligencia artificial Symbolic computation |
| Author | Nils J. Nilsson |
| Edition | illustrated |
| Publisher | Díaz de Santos, 1980 |
| Original from | the University of Michigan |
| Digitized | 15 Nov 2007 |
| ISBN | 0935382011, 9780935382013 |
| Length | 476 pages |
| Subjects | › Computers / Intelligence (AI) & Semantics |
| Export Citation | BiBTeX EndNote RefMan |