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 81
Página 47
... consider the problem of scanning daily newspapers to decide which are supporting the Democrats and which are supporting the Republicans in some upcoming election . Again assuming unlimited computing power , how much knowledge would be ...
... consider the problem of scanning daily newspapers to decide which are supporting the Democrats and which are supporting the Republicans in some upcoming election . Again assuming unlimited computing power , how much knowledge would be ...
Página 276
... consider in choosing ap- propriate people for each post . You do not want to consider all possible pairs of people . Instead , you want to break this problem into two independent sub- problems . But the problems are not really ...
... consider in choosing ap- propriate people for each post . You do not want to consider all possible pairs of people . Instead , you want to break this problem into two independent sub- problems . But the problems are not really ...
Página 354
... consider the max- imum number of ways that each of the four types of lines might combine with other lines at a vertex . Since an L vertex involves two lines , each of which can have four labels , there must be sixteen ways it could be ...
... consider the max- imum number of ways that each of the four types of lines might combine with other lines at a vertex . Since an L vertex involves two lines , each of which can have four labels , there must be sixteen ways it could 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