Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 33
Página 232
... evidence ) and the extent to which E provides evidence of H. To do this , we need to define a universe that contains an exhaustive , mutually exclusive set of H1's , among which we are trying to discriminate . Then , let P ( HE ) = the ...
... evidence ) and the extent to which E provides evidence of H. To do this , we need to define a universe that contains an exhaustive , mutually exclusive set of H1's , among which we are trying to discriminate . Then , let P ( HE ) = the ...
Página 234
... evidence that is described by the antecedent of the rule supports the conclusion that is given in the rule's consequent . A typical MYCIN rule looks like : If : ( 1 ) the stain of the organism is gram - positive , and ( 2 ) the ...
... evidence that is described by the antecedent of the rule supports the conclusion that is given in the rule's consequent . A typical MYCIN rule looks like : If : ( 1 ) the stain of the organism is gram - positive , and ( 2 ) the ...
Página 242
... evidence in favor of a set of propositions . It ranges from 0 ( indicating no evidence ) to 1 ( denoting certainty ) . Plausibility ( PI ) is defined to be Pl ( s ) = 1 - Bel ( ¬s ) It also ranges from 0 to 1 and measures the extent to ...
... evidence in favor of a set of propositions . It ranges from 0 ( indicating no evidence ) to 1 ( denoting certainty ) . Plausibility ( PI ) is defined to be Pl ( s ) = 1 - Bel ( ¬s ) It also ranges from 0 to 1 and measures the extent to ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
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