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 5
As a short example of what we mean by an AI production system, we shall
illustrate how one is used to solve a simple puzzle. 1.1.1. THE 8-PUZZLE Many
AI applications involve composing a sequence of operations. Controlling the
actions of ...
For the 8-puzzle and certain other problems, we can easily identify elements of
the problem that correspond to these three components. These elements are the
problem states, moves, and goal. In the 8-puzzle, each tile configuration is a ...
The 8-puzzle is conveniently interpreted as having the following four moves:
Move empty space (blank) to the left, move blank up, move blank to the right, and
move blank down. These moves are modeled by production rules that operate on
...
Applying hill-climbing to the 8-puzzle we might use, as a function of the state
description, the negative of the number of tiles “out of place,” as compared to the
goal state description. For example, the value of this function for the initial state in
...
As an example, let us apply the backtracking strategy to our 8-puzzle example of
Figure 1.1 where rules are selected according to the arbitrary scheme of first
attempting to move the blank square left, then up, then right, then down. Backing
up ...
What people are saying - Write a review
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 |