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 73
Page 206
We also label the match arc by the mgu , u . As an example , consider the fact
expression { P ( x , y ) V [ Q ( x , A ) A R ( 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 ...
We also label the match arc by the mgu , u . As an example , consider the fact
expression { P ( x , y ) V [ Q ( x , A ) A R ( 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 ...
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 ... These additional constraints
give us the partially ordered plan shown in Figure 8.4 . It is convenient to be able
...
In Figure 8.3 , we show a possible DCOMP first - phase solution with the adders
and deleters listed for each condition . Note that ... These additional constraints
give us the partially ordered plan shown in Figure 8.4 . It is convenient to be able
...
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 ...
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 ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
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 global database goal goal node 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 selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem 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 |