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 19
Página 81
... propagate down to a node , see if its parent points to the node we are coming from . If so , continue the propagation . If not , then its g value already reflects the better path of which it is part . So the propagation may stop here ...
... propagate down to a node , see if its parent points to the node we are coming from . If so , continue the propagation . If not , then its g value already reflects the better path of which it is part . So the propagation may stop here ...
Página 92
... Propagate the newly discovered information up the graph by doing the following : Let S be a set of nodes that have been ... propagation of the cost change back up through a large number of paths that are already known not to be very good ...
... Propagate the newly discovered information up the graph by doing the following : Let S be a set of nodes that have been ... propagation of the cost change back up through a large number of paths that are already known not to be very good ...
Página 93
... Propagation C will always be better than the path through B , so work expended on the path through B is wasted . But if the cost of E is revised and that change is not propagated up through B as well as through C , B may appear to be ...
... Propagation C will always be better than the path through B , so work expended on the path through B is wasted . But if the cost of E is revised and that change is not propagated up through B as well as through C , B may appear to be ...
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 branching factor breadth-first search Chapter chess clauses CLEAR(A complete Computer concept conceptual dependency consider constraints contains database described discussed domain example expert systems exploit explore fact frame game tree goal grammar graph heuristic heuristic function important input INTERLISP ISA links John knowledge representation labelings learning LISP machine Marcus match methods minimax move MYCIN natural language 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 variety