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 36
Página 364
... stored value for A can be used . This creates the effect of having searched an additional several ply since the stored value for A was com- puted by backing up values from exactly such a search . Rote learning of this sort is very ...
... stored value for A can be used . This creates the effect of having searched an additional several ply since the stored value for A was com- puted by backing up values from exactly such a search . Rote learning of this sort is very ...
Página 365
... stored objects down to a manageable level , some kind of generalization is necessary . In Samuel's program , for example , the number of distinct objects that could be stored was equal to the number of different board positions that can ...
... stored objects down to a manageable level , some kind of generalization is necessary . In Samuel's program , for example , the number of distinct objects that could be stored was equal to the number of different board positions that can ...
Página 395
... stored . In standard LISP , such contexts are stored in a simple stack , and so co - routines are not pos- sible . The spaghetti stack is really a tree though , so several parallel con- texts can be stored at once and control can be ...
... stored . In standard LISP , such contexts are stored in a simple stack , and so co - routines are not pos- sible . The spaghetti stack is really a tree though , so several parallel con- texts can be stored at once and control can be ...
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