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 1-3 of 54
... corresponds to a distinguished node in the graph called the start node . The start node has an outgoing connector to a set of successor nodes corresponding to the components of the initial database ( if it can be decomposed ) . Each ...
... correspond to positions in which it is MIN's move next ; these are the MIN nodes . A terminal node is any node corresponding to a winning position for MAX . ( The top node of a game graph is of depth zero , an even number . ) ( 7 , MIN ) ...
... corresponding rule not in the pattern . Thus , F - rule programs contain ASSERT statements corresponding to consequents , and B - rule programs contain GOAL statements corresponding to antecedents . Any variables in these statements ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown