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 75
Page 206
As an example, consider the fact expression {P(x,y)V[Q(x,A)AR(B,y)]} . The AND/
OR graph representation for this fact is shown in Figure 6.5. Now, if we apply the
rule: P(A,B)=>[S(A)V X(B)] to this AND/OR graph, we obtain the AND/OR graph ...
As an example, consider the fact expression {P(x,y)V[Q(x,A)AR(B,y)]} . The AND/
OR graph representation for this fact is shown in Figure 6.5. Now, if we apply the
rule: P(A,B)=>[S(A)V X(B)] to this AND/OR graph, we obtain the AND/OR graph ...
Page 339
In Figure 8.3, we show a possible DCOMP first-phase solution with the adders
and deleters listed for each condition. Note that, compared ... These additional
constraints give us the partially ordered plan shown in Figure 8.4. It is convenient
to ...
In Figure 8.3, we show a possible DCOMP first-phase solution with the adders
and deleters listed for each condition. Note that, compared ... These additional
constraints give us the partially ordered plan shown in Figure 8.4. It is convenient
to ...
Page 342
We begin our discussion by considering another example. Suppose we are trying
to achieve the goal [ CLEAR (A ) A HANDEMPTY] from the initial state shown in
Figure 7.1 (with just one hand now). In Figure 8.6, we show the result of phase ...
We begin our discussion by considering another example. Suppose we are trying
to achieve the goal [ CLEAR (A ) A HANDEMPTY] from the initial state shown in
Figure 7.1 (with just one hand now). In Figure 8.6, we show the result of phase ...
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 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 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 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 |