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 42
Página 220
... created the dependencies in the first place . But suppose we do pick one . Suppose , in particular , that we choose to believe that Babbitt's brother - in - law lied . What should be the justification for that belief ? If we believe it ...
... created the dependencies in the first place . But suppose we do pick one . Suppose , in particular , that we choose to believe that Babbitt's brother - in - law lied . What should be the justification for that belief ? If we believe it ...
Página 221
... creating justifications for the results of applying rules ( although justifications are created as part of contradiction resolution ) choosing among alternative ways of resolving a contradiction ⚫ detecting contradictions All of these ...
... creating justifications for the results of applying rules ( although justifications are created as part of contradiction resolution ) choosing among alternative ways of resolving a contradiction ⚫ detecting contradictions All of these ...
Página 245
... created by the intersection operation are empty . Notice that we are guaranteed by the way we compute m3 that the sum of all its individual values is 1 ( assuming that the sums of all the values of m1 and m2 are 1 ) . If some empty ...
... created by the intersection operation are empty . Notice that we are guaranteed by the way we compute m3 that the sum of all its individual values is 1 ( assuming that the sums of all the values of m1 and m2 are 1 ) . If some empty ...
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