Principles of Artificial Intelligence

Front Cover
Morgan Kaufmann, Jun 28, 2014 - Computers - 476 pages
1 Review

A 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-5 of 5

Page 65
9 GO LOOP This procedure is sufficiently general to encompass a wide variety of
special graph-searching algorithms. The procedure generates an explicit graph,
G, called the search graph and a subset, T, of G called the search tree.
Page 66
In this case, each member of M is added to OPEN and is installed in the search
tree as a successor of n. The search graph is the search tree throughout the
execution of the algorithm, and there is no need to change parents of the nodes
in T. If ...
Page 67
graph and search tree shown in Figure 2.4. The dark arrows along certain arcs in
this search graph are the pointers that define parents of nodes in the search tree.
The solid nodes are on CLOSED, and the other nodes are on OPEN at the time ...
Page 68
UNINFORMED GRAPH-SEARCH PROCEDURES If no heuristic information from
the problem domain is used in ordering ... The first type of uninformed search
orders the nodes on OPEN in descending order of their depth in the search tree.
Page 80
We prove this result using induction on the depth of a node in the A2 search tree
at termination. First, we prove that if A2 expands a node n having zero depth in its
search tree, then so will A1. But, in this case, n = s. If s is a goal node, neither ...

Where's the rest of this book?

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

PROLOGUE
1
CHAPTER 1 PRODUCTION SYSTEMS AND AI
17
CHAPTER 2 SEARCH STRATEGIES FOR AI PRODUCTION SYSTEMS
53
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS
99
CHAPTER 4 THE PREDICATE CALCULUS IN AI
131
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS
161
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS
193
CHAPTER 7 BASIC PLANGENERATING SYSTEMS
275
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS
321
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS
361
PROSPECTUS
417
BIBLIOGRAPHY
429
AUTHOR INDEX
467
SUBJECT INDEX
471
Copyright

Other editions - View all

Principles of Artificial Intelligence
Nils J. Nilsson
Limited preview - 1982
Principles of Artificial Intelligence
Nils J. Nilsson
Snippet view - 1980
Principles of Artificial Intelligence
Nils J. Nilsson
Snippet view - 1986
View all »

Common terms and phrases

8-puzzle achieve actions algorithm AND/OR graph applied Artificial Intelligence atomic formula backed-up value backtracking backward breadth-first breadth-first search called chapter clause form CLEAR(B component CONT(X contains control regime control strategy cost 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 wif graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge literal nodes logic monotone restriction natural language processing negation node labeled ONTABLE ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production rules production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree selected 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 universally quantified unstack(C.A. variables WORKS-IN

About the author (2014)

Nils J. Nilsson's long and rich research career has contributed much to AI. He has written many books, including the classic Principles of Artificial Intelligence. Dr. Nilsson is Kumagai Professor of Engineering, Emeritus, at Stanford University. He has served on the editorial boards of Artificial Intelligence and Machine Learning and as an Area Editor for the Journal of the Association for Computing Machinery. Former Chairman of the Department of Computer Science at Stanford, and former Director of the SRI Artificial Intelligence Center, he is also a past president and Fellow of the American Association for Artificial Intelligence.

Bibliographic information

QR code for Principles of Artificial Intelligence
TitlePrinciples of Artificial Intelligence
AuthorNils J. Nilsson
Editionreprint
PublisherMorgan Kaufmann, 2014
ISBN1483295869, 9781483295862
Length476 pages
Subjects ›  › 

Computers / Artificial Intelligence / Expert Systems
Computers / Artificial Intelligence / General
Computers / Data Science / General
Computers / General
  
Export CitationBiBTeX EndNote RefMan