Artificial Intelligence |
From inside the book
Results 1-3 of 80
Page 239
... section , we described CF's as a mechanism for reducing the complexity of a Bayesian reasoning system by making some approximations to the formalism . In this section , we describe an alternative approach , Bayesian networks [ Pearl ...
... section , we described CF's as a mechanism for reducing the complexity of a Bayesian reasoning system by making some approximations to the formalism . In this section , we describe an alternative approach , Bayesian networks [ Pearl ...
Page 301
... section we briefly discuss three additional methods : constraints , simulation models , and subsymbolic systems . Keep in mind throughout this discussion that it is not always the case that these various representational systems are ...
... section we briefly discuss three additional methods : constraints , simulation models , and subsymbolic systems . Keep in mind throughout this discussion that it is not always the case that these various representational systems are ...
Page 398
... Section 15.1.1 . But even in this case , it is useful , as we showed in that example , to use an intermediate knowledge - based representation to guide the overall process . So , in the rest of this section , we assume that the target ...
... Section 15.1.1 . But even in this case , it is useful , as we showed in that example , to use an intermediate knowledge - based representation to guide the overall process . So , in the rest of this section , we assume that the target ...
Contents
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Copyright | |
24 other sections not shown
Other editions - View all
Common terms and phrases
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's