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 18
Page 56
... recursively on the new database . 9 if PATH = FAIL , go LOOP ; if the recursive call fails , try another rule . 10 return CONS ( R , PATH ) ; otherwise , pass the successful list of rules up , by adding R to the front of the list . We ...
... recursively on the new database . 9 if PATH = FAIL , go LOOP ; if the recursive call fails , try another rule . 10 return CONS ( R , PATH ) ; otherwise , pass the successful list of rules up , by adding R to the front of the list . We ...
Page 60
... recursive algorithm does not remember all databases that it visited previously . Backtracking involves " forgetting " all databases whose paths lead to failures . The algorithm remembers only those databases on the current path back to ...
... recursive algorithm does not remember all databases that it visited previously . Backtracking involves " forgetting " all databases whose paths lead to failures . The algorithm remembers only those databases on the current path back to ...
Page 247
... recursive . The introduction of recursive functions in program synthesis comes about by using mathematical induction in the proof . It turns out that in reversing a list by using an append function , we have double recursion , once in ...
... recursive . The introduction of recursive functions in program synthesis comes about by using mathematical induction in the proof . It turns out that in reversing a list by using an append function , we have double recursion , once in ...
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
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 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(B 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 unifying composition universally quantified unstack(C,A variables WORKS-IN