Principles of Artificial Intelligence
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.
Results 1-5 of 9
... MONOTONE RESTRICTION Describing the GRAPHSEARCH procedure, we noted that 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 ...
... 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 monotone restriction in the form h (ni) s h (ni) + c (ni, nj), it is seen to be similar to a ...
... monotone restriction is satisfied, then A* has already found an optimal path to any node it selects for expansion. That is, if A* selects n for expansion, and if the monotone restriction is satisfied, g(n) = g”(n). The monotone restriction ...
... monotone restriction implies c(n1, m2) + h (n2) > h (n1), we have f(n2) > g(n1) + h (n1) = f(n1). Since this fact is true for any adjacent pair of nodes in the sequence of nodes expanded by A*, we have RESULT 8: If the monotone ...
You have reached your viewing limit for this book.
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS
CHAPTER 4 THE PREDICATE CALCULUS IN AI
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS
CHAPTER 7 BASIC PLANGENERATING SYSTEMS
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS