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 75
Página 44
... path we follow . If we do follow one path successfully to the answer , there is no reason to go back and see if some other path might also lead to a solution . But now consider again the traveling salesman problem . Our goal is to find ...
... path we follow . If we do follow one path successfully to the answer , there is no reason to go back and see if some other path might also lead to a solution . But now consider again the traveling salesman problem . Our goal is to find ...
Página 81
... path in g ( OLD ) , and update f ' ( OLD ) . 4. If SUCCESSOR was not on OPEN , see if it is on CLOSED . If so , call the node on CLOSED OLD , and add OLD to the list of BESTNODE's successors . Check to see if the new path or the old path ...
... path in g ( OLD ) , and update f ' ( OLD ) . 4. If SUCCESSOR was not on OPEN , see if it is on CLOSED . If so , call the node on CLOSED OLD , and add OLD to the list of BESTNODE's successors . Check to see if the new path or the old path ...
Página 125
... PATH = BEST - PATH 6. Return the structure VALUE = PASS - THRESH ; PATH = BEST - PATH The effectiveness of the alpha - beta procedure depends greatly on the order in which paths are examined . If the worst paths are examined first ...
... PATH = BEST - PATH 6. Return the structure VALUE = PASS - THRESH ; PATH = BEST - PATH The effectiveness of the alpha - beta procedure depends greatly on the order in which paths are examined . If the worst paths are examined first ...
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