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 73
Página 155
... 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 with fewer literals than ...
... 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 with fewer literals than ...
Página 160
... prove that Marcus hates some ruler , we would be likely to try each substitution shown in Figure 5.13 ( a ) and ( b ) before finding the contradiction shown in ( c ) . Sometimes there is no way short of very good luck to avoid trying ...
... prove that Marcus hates some ruler , we would be likely to try each substitution shown in Figure 5.13 ( a ) and ( b ) before finding the contradiction shown in ( c ) . Sometimes there is no way short of very good luck to avoid trying ...
Página 162
... prove this . To do so using resolution , we attempt to show that -3t : died ( Marcus , t ) produces a contradiction . What does it mean for that statement to produce a contradic- tion ? Either it conflicts with a statement of the form ...
... prove this . To do so using resolution , we attempt to show that -3t : died ( Marcus , t ) produces a contradiction . What does it mean for that statement to produce a contradic- tion ? Either it conflicts with a statement of the form ...
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