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 85
... graph of order n with degree sequence (d1,d2 ,··· ,dn) in non-increasing order. Find the degree sequence of G in non-increasing order. Solution. Let d 1 ≥ d2 ≥···≥ dn be the non-increasing degree sequence of G. Then n−1−d n is the ...
... solutions. This defines a solution graph for every instance, which is usually exponentially large in the input size. Usually, it is assumed that adjacency and being a feasible solution can be tested in polynomial time. Typical questions ...
... Solution . The graph H must be bipartite . We prove it by contradiction as follows . Suppose on the contrary that H is not bipartite . Then , by Theorem 3.1 , H contains an odd cycle C : v1v2 · · V2k + 1V1 . We may assume that v1 is odd ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown