Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 65
Página 136
... statements and then using those statements to deduce new ones : • Many English sentences are ambiguous ( for example , 5 , 6 , and 7 above ) . Choosing the correct interpretation may be difficult . There is often a choice of how to ...
... statements and then using those statements to deduce new ones : • Many English sentences are ambiguous ( for example , 5 , 6 , and 7 above ) . Choosing the correct interpretation may be difficult . There is often a choice of how to ...
Página 144
... statement ( i.e. , show that it is valid ) , resolution attempts to show that the negation of the statement produces a contradiction with the known statements ( i.e. , that it is unsatisfiable ) . This approach contrasts with the ...
... statement ( i.e. , show that it is valid ) , resolution attempts to show that the negation of the statement produces a contradiction with the known statements ( i.e. , that it is unsatisfiable ) . This approach contrasts with the ...
Página 155
... statement we are trying to prove . Any other contradiction would say that the previously believed statements were inconsistent . Whenever possible , resolve with clauses that have a single literal . Such resolutions generate new clauses ...
... statement we are trying to prove . Any other contradiction would say that the previously believed statements were inconsistent . Whenever possible , resolve with clauses that have a single literal . Such resolutions generate new clauses ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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