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-5 of 37
Page 6
... cost path over the edges of a graph containing n nodes such that the path visits each of the n nodes precisely once . Many puzzles have this same general character . Another example is the 8 - queens problem , where the problem is to ...
... cost path over the edges of a graph containing n nodes such that the path visits each of the n nodes precisely once . Many puzzles have this same general character . Another example is the 8 - queens problem , where the problem is to ...
Page 20
... cost to each move and then attempt to find a solution having minimal cost . These elaborations can easily be handled by methods we describe later on . 1.1.2 . THE BASIC PROCEDURE The basic production system algorithm for solving a ...
... cost to each move and then attempt to find a solution having minimal cost . These elaborations can easily be handled by methods we describe later on . 1.1.2 . THE BASIC PROCEDURE The basic production system algorithm for solving a ...
Page 53
... costs of a production system into two major categories : rule application costs and control costs . A completely uninformed control system incurs only a small control strategy cost because merely arbitrary rule selection need not depend ...
... costs of a production system into two major categories : rule application costs and control costs . A completely uninformed control system incurs only a small control strategy cost because merely arbitrary rule selection need not depend ...
Page 54
Nils J. Nilsson. Computational Cost 0 0 Rule application cost " Informedness " Overall cost for the production system Control strategy cost COMPLETE Fig . 2.1 Computational costs of Al production systems . Completely informed control ...
Nils J. Nilsson. Computational Cost 0 0 Rule application cost " Informedness " Overall cost for the production system Control strategy cost COMPLETE Fig . 2.1 Computational costs of Al production systems . Completely informed control ...
Page 63
... costs to arcs , to represent the cost of applying the corresponding rule . We use the notation c ( n1 , n ; ) to denote the cost of an arc directed from node ni to node n ;. It will be important in some of our later arguments to assume ...
... costs to arcs , to represent the cost of applying the corresponding rule . We use the notation c ( n1 , n ; ) to denote the cost of an arc directed from node ni to node n ;. It will be important in some of our later arguments to assume ...
Contents
| 1 | |
| 17 | |
| 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 |
Other editions - View all
Common terms and phrases
8-puzzle achieve actions Adders 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 Deleters 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 HOLDING(A implication initial state description knowledge leaf nodes literal nodes logic methods monotone restriction negation node labeled 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 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 unifying composition universally quantified