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 26
... conjunctions , and each of the component formulas is called a conjunct . Any conjunction composed of wffs is also a wff . The symbol " V " is used to represent inclusive " or . " For example , the sentence " John plays centerfield or ...
... conjunction of several such formulas can serve as a description of a particular situation or " world state . " We call it a state description . Actually , any finite conjunction of formulas really describes a family of different world ...
... conjunction [ B ( x ) ^ C ( x ) ] ; nevertheless , we treat this conjunction as a single literal and proceed formally as if the formula were a clause ( none of the elements of this conjunction are ever in any unification sets ) ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown