Artificial IntelligenceA revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
From inside the book
Results 1-3 of 53
Page 56
... operators are chosen , the 8 - Puzzle and the blocks world problem can also be considered partially commutative ... operators available include such things as " Add chemical x to the pot " or " Change the temperature to t degrees ...
... operators are chosen , the 8 - Puzzle and the blocks world problem can also be considered partially commutative ... operators available include such things as " Add chemical x to the pot " or " Change the temperature to t degrees ...
Page 337
... operators . But what happens during the process of searching for the correct operator sequence ? If one incorrect sequence is explored , it must be possible to return to the original state so that a different one can be tried . But this ...
... operators . But what happens during the process of searching for the correct operator sequence ? If one incorrect sequence is explored , it must be possible to return to the original state so that a different one can be tried . But this ...
Page 347
... operators for attaining the first goal , followed by a complete sequence for the second goal , etc. But as we have seen , difficult problems cause goal interactions . The operators used to solve one subproblem may interfere with the ...
... operators for attaining the first goal , followed by a complete sequence for the second goal , etc. But as we have seen , difficult problems cause goal interactions . The operators used to solve one subproblem may interfere with the ...
Contents
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Copyright | |
25 other sections not shown
Other editions - View all
Common terms and phrases
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space