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 38
Page 135
... 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 ~ FI V F2 always has the same truth value as Fl⇒ F2 , so we really wouldn't ever ...
... 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 ~ FI V F2 always has the same truth value as Fl⇒ F2 , so we really wouldn't ever ...
Page 176
... 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 ...
... 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 ...
Page 184
... 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 ...
... 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 | |
12 other sections not shown
Other editions - View all
Common terms and phrases
achieve actions algorithm AND/OR graph answer applied arcs Artificial Intelligence assume attempt backtracking backward block called chapter clause CLEAR CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed evaluation example expression F-rule fact Figure formula function given global database goal goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals logic match methods move namely node Note obtained occur ONTABLE(A operation path possible precondition predicate calculus problem procedure production system proof prove quantified reasoning refutation represent representation resolution result robot rule satisfied selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem unifying unit University variables