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 82
Página 75
... applying each of the rules that were applied along the best path to the node . The function h ' is an estimate of the additional cost of getting from the current node to a goal state . This is the place where knowledge about the problem ...
... applying each of the rules that were applied along the best path to the node . The function h ' is an estimate of the additional cost of getting from the current node to a goal state . This is the place where knowledge about the problem ...
Página 182
... applied , and so forth , until a solution is found . We have suggested that clever search involves choosing from among the rules that can be applied at a particular point , the ones that are most likely to lead to a solution . But we ...
... applied , and so forth , until a solution is found . We have suggested that clever search involves choosing from among the rules that can be applied at a particular point , the ones that are most likely to lead to a solution . But we ...
Página 337
... applied . Figure 13.3 shows a small example of such a search tree and the corresponding global database . The ... applying UNSTACK to the initial situation . If we repeat this process using the ADD and DELETE lists of UNSTACK , we derive ...
... applied . Figure 13.3 shows a small example of such a search tree and the corresponding global database . The ... applying UNSTACK to the initial situation . If we repeat this process using the ADD and DELETE lists of UNSTACK , we derive ...
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