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 85
Página 12
... called the element's key . Sometimes this key is simply the element itself . This would be done if , for example , the elements being considered were already integers . If the elements are not already in a numeric form , however , they ...
... called the element's key . Sometimes this key is simply the element itself . This would be done if , for example , the elements being considered were already integers . If the elements are not already in a numeric form , however , they ...
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 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 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