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 23
... search procedure is called uninformed. In AI, we are typically not interested in uninformed procedures, but we describe two types here for purposes of comparison: depth-first search and breadth-first search. The first type of uninformed ...
... first procedure generates new databases in an order similar to that generated by an uninformed backtracking control strategy. The correspondence would be exact if the graph-search ... breadth-first because expansion of nodes in the search ...
... b ::d r :.::"y *28lb s :::ed ::C i|-:odu :r :::|p :ee : ::|tr |h |arc e :S : ::7A :2.:2 'g. i : F. : -: :: : :: : : : : : :|: : : : : :: : s: : : S 2.4. HEURISTIC GRAPH-SEARCH PROCEDURES The uninformed search methods, whether breadth-first.
Nils J. Nilsson. 2.4. HEURISTIC GRAPH-SEARCH PROCEDURES The uninformed search methods, whether breadth-first or depth-first, are exhaustive methods for finding paths to a goal node. In principle, these methods provide a solution to the ...
... search methods, although the use of the evaluation function has resulted in substantially fewer nodes being expanded. (If we simply use the evaluation function f(n) = d(n), we get the breadth-first search process.) The choice of ...
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