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 Intelligence evolved 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 23
Page 21
CONTROL The above procedure is nondeterministic because we have not yet
specified precisely how we are going to select an ... In an irrevocable control
regime , an applicable rule is selected and applied irrevocably without provision
for ...
CONTROL The above procedure is nondeterministic because we have not yet
specified precisely how we are going to select an ... In an irrevocable control
regime , an applicable rule is selected and applied irrevocably without provision
for ...
Page 22
In the second type of tentative control regime , which we call graph - search
control , provision is made for keeping track of the effects of several sequences of
rules simultaneously . Various kinds of graph structures and graph searching ...
In the second type of tentative control regime , which we call graph - search
control , provision is made for keeping track of the effects of several sequences of
rules simultaneously . Various kinds of graph structures and graph searching ...
Page 27
Suppose we decide to use a graph - search control regime in solving the 8 -
puzzle problem posed in Figure 1.1 . We can keep track of the various rules
applied and the databases produced by a structure called a search tree . An
example of ...
Suppose we decide to use a graph - search control regime in solving the 8 -
puzzle problem posed in Figure 1.1 . We can keep track of the various rules
applied and the databases produced by a structure called a search tree . An
example of ...
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
achieve actions algorithm AND/OR graph answer applied arcs assertions assume attempt backtracking backward block called chapter clause CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database Deleters described direction discussed efficient evaluation example expanded 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 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 unifying unit universal variables
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 |
| Subjects | › Reference / General |
| Export Citation | BiBTeX EndNote RefMan |