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
... proof for ( 3x ) W ( x ) from S is an ordinary predicate calculus theorem- proving problem , but producing the satisfying instance for x requires that the proof method be " constructive . " We note that the prospect of producing ...
... proof tree with some statement at the root that can be used as an answer . Since the conversion involves converting every clause arising from the negation of the goal wff into a tautology , the converted proof tree is a resolution proof ...
... proof but will merely trickle down to occur in the final answer statement . Resolutions in the modified proof will still be limited to those defined by those unification sets corresponding to the unification sets occurring in the ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown