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 34
Página 116
... idea is to start at the current posi- tion and use the plausible - move generator to generate the set of possible succes- sor positions . Now we could apply the static evaluation function to those posi- tions and simply choose the best ...
... idea is to start at the current posi- tion and use the plausible - move generator to generate the set of possible succes- sor positions . Now we could apply the static evaluation function to those posi- tions and simply choose the best ...
Página 154
... idea of unification is very simple . It is easiest to describe if we represent each literal as a list , where the first element is the name of the predi- cate and the remaining elements are the arguments , each 154 KNOWLEDGE ...
... idea of unification is very simple . It is easiest to describe if we represent each literal as a list , where the first element is the name of the predi- cate and the remaining elements are the arguments , each 154 KNOWLEDGE ...
Página 197
... Idea ? We have just discussed a variety of techniques for handling probabilistic infor- mation . We have also mentioned some dangers inherent in some of those tech- niques . It would be useful if we had a set of guidelines for when ...
... Idea ? We have just discussed a variety of techniques for handling probabilistic infor- mation . We have also mentioned some dangers inherent in some of those tech- niques . It would be useful if we had a set of guidelines for when ...
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