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 84
Página 34
... called combinatorial explosion . To combat it , a new control strategy is needed . We can beat the strategy outlined above using a technique called branch- and - bound . Begin generating complete paths , keeping track of the shortest ...
... called combinatorial explosion . To combat it , a new control strategy is needed . We can beat the strategy outlined above using a technique called branch- and - bound . Begin generating complete paths , keeping track of the shortest ...
Página 309
... called the total vocabulary . ⚫ is a nonempty subset of V called the terminal alphabet . Call V - Σ the nonterminal alphabet N. • P is a finite set of productions of the form a → ẞ , where a € V * NV * and B € V * * is the Kleene ...
... called the total vocabulary . ⚫ is a nonempty subset of V called the terminal alphabet . Call V - Σ the nonterminal alphabet N. • P is a finite set of productions of the form a → ẞ , where a € V * NV * and B € V * * is the Kleene ...
Página 402
... called , A , B , and C are bound . So the PROLOG interpreter must find a value for D such that Discrim is true of ( A , B , C , D ) . The same is true of the calls to the built - in functions Mult and Add . They are called with two ...
... called , A , B , and C are bound . So the PROLOG interpreter must find a value for D such that Discrim is true of ( A , B , C , D ) . The same is true of the calls to the built - in functions Mult and Add . They are called with two ...
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