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 94
... called declarative knowledge . In an intelligent information retrieval system , for example , the declarative knowledge would include the main database of specific facts . The knowledge about a problem that is represented in the rules ...
... called 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 ...
... called the antecedent , and the right - hand side is called the consequent . If both the antecedent and the consequent are wffs , then the implication is a wff also . An implication has value T if either the consequent has value T ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown