Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 78
Página 80
... task faced by the mathematics discovery program AM , written by Lenat [ 1977 ; 1982 ] . AM was given a small set of ... task , doing it , and possibly generating new tasks in the process . This corresponds to the selection of the most ...
... task faced by the mathematics discovery program AM , written by Lenat [ 1977 ; 1982 ] . AM was given a small set of ... task , doing it , and possibly generating new tasks in the process . This corresponds to the selection of the most ...
Página 81
... task . One important question that arises in agenda - driven systems is how to find the most promising task on each cycle . One way to do this is simple . Maintain the agenda sorted by rating . When a new task is created , insert it ...
... task . One important question that arises in agenda - driven systems is how to find the most promising task on each cycle . One way to do this is simple . Maintain the agenda sorted by rating . When a new task is created , insert it ...
Página 436
... task . For relatively simple tasks , such as the one we just described , the various agents can communicate effectively with each other just by announcing when operations have been completed . For other kinds of tasks , though , it is ...
... task . For relatively simple tasks , such as the one we just described , the various agents can communicate effectively with each other just by announcing when operations have been completed . For other kinds of tasks , though , it is ...
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