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 41
Página 7
... element will contain the value 0 ( indicating the cor- responding square is blank ) , 1 ( indicating an X ) , or 2 ( indicating an O ) . A vector of 19,683 elements ( 39 ) , each element of which is a nine - element vector . To make a ...
... element will contain the value 0 ( indicating the cor- responding square is blank ) , 1 ( indicating an X ) , or 2 ( indicating an O ) . A vector of 19,683 elements ( 39 ) , each element of which is a nine - element vector . To make a ...
Página 12
... 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 must be ...
... 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 must be ...
Página 155
... elements match , then we must check the remain- ing elements , one pair at a time . If the first matches , we can continue with the second , and so on . To test each of the remaining elements , we can simply call the unification ...
... elements match , then we must check the remain- ing elements , one pair at a time . If the first matches , we can continue with the second , and so on . To test each of the remaining elements , we can simply call the unification ...
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