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 11-15 of 43
... when a node n is expanded, some of its successors may already be on OPEN or CLOSED. The search tree may then need to be adjusted so that it defines the least costly paths in G from nodes to the 81 HEURISTIC GRAPH-SEARCH PROCEDURES.
... successors of this node in the search graph. A heuristic function, h, is said to satisfy the monotone restriction if for all nodes n, and n, such that n, is a successor of n, h (ni) ā h (n;) s c(ni, n,) with h(t) = 0. If we write the ...
... added to OPEN by the process of expanding n1. Therefore, n2 is a successor of n.1. Under these conditions, when n2 is selected for expansion we have f(n2) = g(n2) + h (ng) = gā(n2) + h(n,) 83 HEURISTIC GRAPH-SEARCH PROCEDURES.
... successor and allotting 0 for every other tile; a piece in the center scores one. We note that this h function does not provide a lower bound for h". With this heuristic function used in the evaluation function f(n) = g(n) + h (n), we ...
You have reached your viewing limit for this book.
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 |