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 30
Página 283
... backtracking process will always return to the node that appears overall to be the next most promising . Continuing with the example , we see that KS1 generates two hypotheses , nodes J and K. K appears the most promising to KS1 , but ...
... backtracking process will always return to the node that appears overall to be the next most promising . Continuing with the example , we see that KS1 generates two hypotheses , nodes J and K. K appears the most promising to KS1 , but ...
Página 311
... backtracking - Follow only one path at a time , but record , at every choice point , the information that is necessary to make another choice if the chosen path fails to lead to a complete interpretation of the sentence . In this ...
... backtracking - Follow only one path at a time , but record , at every choice point , the information that is necessary to make another choice if the chosen path fails to lead to a complete interpretation of the sentence . In this ...
Página 403
... backtracking ) , sprout ( for parallelism ) o PLANNER : recursion , backtracking via goals o KRL : INTERLISP , agendas o PROLOG : recursion , backtracking via goals Interactiveness O LISP : yes 。 INTERLISP : yes , DWIM , PROGRAMMER'S ...
... backtracking ) , sprout ( for parallelism ) o PLANNER : recursion , backtracking via goals o KRL : INTERLISP , agendas o PROLOG : recursion , backtracking via goals Interactiveness O LISP : yes 。 INTERLISP : yes , DWIM , PROGRAMMER'S ...
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