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 57
Página 33
... tree with the initial state as its root . Generate all the offspring of the root by applying each of the applicable rules to the initial state . Figure 2-5 shows how the tree looks at this point . Now , for each leaf node , generate all ...
... tree with the initial state as its root . Generate all the offspring of the root by applying each of the applicable rules to the initial state . Figure 2-5 shows how the tree looks at this point . Now , for each leaf node , generate all ...
Página 60
... tree traversal . Each node of the tree is expanded by the production rules to generate a set of successor nodes , each of which can in turn be expanded , continuing until a node represent- ing a solution is found . A piece of such a search ...
... tree traversal . Each node of the tree is expanded by the production rules to generate a set of successor nodes , each of which can in turn be expanded , continuing until a node represent- ing a solution is found . A piece of such a search ...
Página 61
... tree , which has already been expanded . Those two paths have not gotten us anywhere . So we would like to eliminate ... tree , we traverse a directed graph . This graph differs from a tree in that several paths may come together at a ...
... tree , which has already been expanded . Those two paths have not gotten us anywhere . So we would like to eliminate ... tree , we traverse a directed graph . This graph differs from a tree in that several paths may come together at a ...
Otras ediciones - Ver todas
Términos y frases comunes
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraint contains database described discussed domain example expert systems exploit explore fact frame game tree given grammar graph heuristic function important input INTERLISP ISA links John knowledge representation labelings learning LISP Marcus match minimax move MTRANS MYCIN node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production systems PROLOG propositional logic question reasoning representing knowledge resolution rules satisfied script search procedure search process Section semantic net semantic nets sentence shown in Figure simple situation slots solution solve specific statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding UNSTACK variable variety vertex