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 74
... block with several red faces , it would be a good idea to use as few of them as possible as outside faces . As many of them as possible should be placed to abut the next block . Using this heuristic , many configurations need never be ...
... block with several red faces , it would be a good idea to use as few of them as possible as outside faces . As many of them as possible should be placed to abut the next block . Using this heuristic , many configurations need never be ...
Página 270
... block to be put down or stacked . In order to perform the operation , some specific block must be bound to the variable . The preconditions of both of the operators require that the arm be holding the block that is to be put down or ...
... block to be put down or stacked . In order to perform the operation , some specific block must be bound to the variable . The preconditions of both of the operators require that the arm be holding the block that is to be put down or ...
Página 276
... block A , then A must be unstacked from something . So it was necessary to write the operator UNSTACK ( A , x ) . In principle , any block could be substituted for x . But unless A was already on some particular block , which should be ...
... block A , then A must be unstacked from something . So it was necessary to write the operator UNSTACK ( A , x ) . In principle , any block could be substituted for x . But unless A was already on some particular block , which should 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