Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 63
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 ...
... 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 ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
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