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 54
Page 107
... obtained after various cycles through the outer loop of AO * are shown in Figure 3.3 . In each graph , the revised q values are shown next to each node ; heavy arrows are used to mark connectors , and nodes labeled SOLVED are indicated ...
... obtained after various cycles through the outer loop of AO * are shown in Figure 3.3 . In each graph , the revised q values are shown next to each node ; heavy arrows are used to mark connectors , and nodes labeled SOLVED are indicated ...
Page 151
... obtain the resolvent P [ z , f ( y ) ] ▽ ~ Q ( z ) ▽ Q ( y ) . With { 4 } = [ P ( x , ƒ ( A ) ] , P [ x , ƒ ( y ) ... obtained by resolving on P and one by resolving on Q. It is not difficult to show that resolution is a sound rule of ...
... obtain the resolvent P [ z , f ( y ) ] ▽ ~ Q ( z ) ▽ Q ( y ) . With { 4 } = [ P ( x , ƒ ( A ) ] , P [ x , ƒ ( y ) ... obtained by resolving on P and one by resolving on Q. It is not difficult to show that resolution is a sound rule of ...
Page 176
... obtained in the usual manner , by first 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 ...
... obtained in the usual manner , by first 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 ...
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 contains control regime control strategy cost 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 literal nodes logic methods monotone restriction natural language processing negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree selected semantic network sequence shown in Figure Skolem function solution graph solve stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes universally quantified unstack(C,A variables WORKS-IN