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 39
... negation . The negation of a wff is also a wff . An atomic formula and the negation of an atomic formula are both called literals . It is easy to see that ~ F1 V F2 always has the same truth value as F1⇒ F2 , so we really wouldn't ever ...
... negating the wff to be proved , adding this negation to the set S , converting all of the members of this enlarged set to clause form , and then , by resolution , showing that this set of clauses is unsatisfiable . A refutation tree for ...
... negation of the goal wff , causing Skolem functions to be introduced . What is to be the interpretation of these Skolem functions if they should eventually appear as terms in the answer statement ? We illustrate this problem with ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown