Artificial Intelligence, Volumen1McGraw-Hill, 1983 - 436 páginas What is artificial intelligence?; Problem solving; Problems and problem spaces; Basic problem-solving methods; Game playing; Knowledge representation; Knowledge representation using predicate logic; Knowledge representation using other logics; Structured representation of knowledge; Advanced topics; Advanced problem-solving systems; Natural language understanding; Perception; Learning; Implementing A.lI. systems: languages and machines; Conclusion; References; Index. |
Dentro del libro
Resultados 1-3 de 37
Página 62
... graph . A cycle is a path through the graph in which a given node appears more than once . For example , the graph of Figure 3-5 contains two cycles of length two . One includes the nodes ( 0,0 ) and ( 4,0 ) ; the other includes the ...
... graph . A cycle is a path through the graph in which a given node appears more than once . For example , the graph of Figure 3-5 contains two cycles of length two . One includes the nodes ( 0,0 ) and ( 4,0 ) ; the other includes the ...
Página 87
... 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 91
... graph without risk of missing a solution . Although the lack of cycles in the search graph simplifies some parts of the search algorithm , it complicates another part . Whenever a successor is generated and found to be already in the ...
... graph without risk of missing a solution . Although the lack of cycles in the search graph simplifies some parts of the search algorithm , it complicates another part . Whenever a successor is generated and found to be already in the ...
Otras ediciones - Ver todas
Términos y frases comunes
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY Artificial Intelligence backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraints contains database described discussed domain example exploit explore fact frame game tree goal grammar graph heuristic heuristic function important input INTERLISP ISA links John knowledge representation labelings LISP Marcus match methods minimax move MYCIN natural language necessary node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production system PROLOG propositional logic question reasoning representing knowledge rules Schank script search procedure search process Section semantic net sentence shown in Figure simple situation slots solution solve specific stack statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding variety