Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 49
Página 59
... graph just as for a tree . 3. If it does already exist , then do the following : ( a ) Set the node that is being ... graph . A cycle is a path through the graph in which a given node appears more than once . For example , the graph of ...
... graph just as for a tree . 3. If it does already exist , then do the following : ( a ) Set the node that is being ... graph . A cycle is a path through the graph in which a given node appears more than once . For example , the graph of ...
Página 82
... graph , several arcs may emerge from a single node , indicating a variety of ways in which the original problem might be solved . This is why the structure is called not simply an AND graph but rather an AND - OR graph . An example of ...
... graph , several arcs may emerge from a single node , indicating a variety of ways in which the original problem might be solved . This is why the structure is called not simply an AND graph but rather an AND - OR graph . An example of ...
Página 396
... graphs we have just described . It will be very similar to logical unification . Two graphs unify if , recursively , all their subgraphs unify . The result of a successful unification is a graph that is composed of the union of the ...
... graphs we have just described . It will be very similar to logical unification . Two graphs unify if , recursively , all their subgraphs unify . The result of a successful unification is a graph that is composed of the union of the ...
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