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 57
Page 116
... assume that were MAX to choose among tip nodes , he would choose that node having the largest evaluation . Therefore ... assuming that MAX would choose that node with the largest backed - up value while MIN would choose that node with ...
... assume that were MAX to choose among tip nodes , he would choose that node having the largest evaluation . Therefore ... assuming that MAX would choose that node with the largest backed - up value while MIN would choose that node with ...
Page 205
... assuming that A is true and then attempt to prove the goal assuming B is true . If both proofs succeed , we have a proof based ... assume that any existential variables in facts and rules have been Skolemized . For goal wffs containing ...
... assuming that A is true and then attempt to prove the goal assuming B is true . If both proofs succeed , we have a proof based ... assume that any existential variables in facts and rules have been Skolemized . For goal wffs containing ...
Page 277
... assumed to have existential quantifica- tion . For initial and intermediate state descriptions , we allow only conjunctions ... assume here that the preconditions of our F - rules consist of a conjunction of literals . Variables in these ...
... assumed to have existential quantifica- tion . For initial and intermediate state descriptions , we allow only conjunctions ... assume here that the preconditions of our F - rules consist of a conjunction of literals . Variables in these ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
8-puzzle achieve actions Adders AI production algorithm AND/OR graph applied Artificial Intelligence atomic formula backed-up value backtracking backward block breadth-first breadth-first search called chapter clause form CLEAR(C component CONT(Y,A contains control regime control strategy cost DCOMP Deleters delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge leaf nodes literal nodes logic negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production system proof prove recursive regress represent representation result robot problem rule applications search graph search tree selected semantic network sequence shown in Figure Skolem function solution graph solve SRI International stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes universally quantified unstack(C,A variables WORKS-IN