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-3 of 54
... search tree preserve the least costly path found so far from s to any of its nodes . ( The cost of a path from s to n in the search tree can be computed ... search tree shown in Figure 2.4 . The 66 SEARCH STRATEGIES FOR AI PRODUCTION SYSTEMS.
Nils J. Nilsson. graph and search tree shown in Figure 2.4 . The dark arrows along certain arcs in this search graph are the pointers that define parents of nodes in the search tree . The solid nodes are on CLOSED , and the other nodes ...
... search , which uses h ( n ) = 0 . We would expect intuitively that the more informed algorithm typically would need ... tree at termination . First , we prove that if A , expands a node n having zero depth in its search tree , then so ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown