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 21
... disjunctions , and each of the component formulas is called a disjunct . Any disjunction composed of wffs is also a wff . The truth values of conjunctions and disjunctions are determined from the truth values of the components . A ...
... disjunctions of literals . Such a matrix is said to be in conjunctive normal form . Examples of matrices in ... disjunction of literals is called a clause . Our example wff is transformed into the following set of clauses : ~ P ...
... disjunction ( A V B ) , and it wouldn't matter which of A or B was true . In Figure 6.4 , the descendants of the node labeled by ( A V B ) are connected to it by a 2 - connector ; thus both of these descendants must occur ( as they ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown