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 56
... termination condition . That is , if we are to work on each component separately , we must be able to express the global termination condition using the termination conditions of each of the components . The most important case occurs ...
... termination is feasible . A gross estimate of the size of the tic - tac - toe game tree , for example , can be obtained by noting that the start node has nine successors , these in turn have eight , etc. , yielding 9 ! ( or 362,880 ) ...
... termination condition . Termination must involve the proper kind of abutment between the two graph structures . These structures can be joined by match edges at nodes labeled by literals that unify . We label the match edges themselves ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown