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 86
Página 64
... solution by comparing the chosen point or the endpoint of the chosen path to the set of acceptable goal states . 3. If a solution has been found , quit . Otherwise , return to step 1 . If the generation of possible solutions is done ...
... solution by comparing the chosen point or the endpoint of the chosen path to the set of acceptable goal states . 3. If a solution has been found , quit . Otherwise , return to step 1 . If the generation of possible solutions is done ...
Página 90
... solution consistent with all the known constraints . If the contradiction involves only those constraints that were given as part of the problem specification ( as opposed to ones that were guessed during problem solving ) , then no ...
... solution consistent with all the known constraints . If the contradiction involves only those constraints that were given as part of the problem specification ( as opposed to ones that were guessed during problem solving ) , then no ...
Página 480
... solution to a previous problem into a solution for the current problem . Figure 17.19 shows this process . An example of transformational analogy is shown in Figure 17.20 [ Anderson and Kline , 1979 ] . The program has seen proofs about ...
... solution to a previous problem into a solution for the current problem . Figure 17.19 shows this process . An example of transformational analogy is shown in Figure 17.20 [ Anderson and Kline , 1979 ] . The program has seen proofs about ...
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