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 67
Página 91
... prove X if we could prove Y. We might then show that we could prove Y if we could prove X. But such a circular path can never constitute a proof . So the path can be omitted from the graph without risk of missing a solution . Although ...
... prove X if we could prove Y. We might then show that we could prove Y if we could prove X. But such a circular path can never constitute a proof . So the path can be omitted from the graph without risk of missing a solution . Although ...
Página 159
... prove . Any other contradiction would say that the previously believed statements were inconsistent . • Whenever possible , resolve with clauses with a single literal . Such resolu- tions generate new clauses with fewer literals than ...
... prove . Any other contradiction would say that the previously believed statements were inconsistent . • Whenever possible , resolve with clauses with a single literal . Such resolu- tions generate new clauses with fewer literals than ...
Página 177
... prove true are true ( hopefully none ) and that the rest are not . Then it can go ahead and assume it can use the ... prove X. But since it is not decidable whether X can be proved , the validity of the larger proof in which it is ...
... prove true are true ( hopefully none ) and that the rest are not . Then it can go ahead and assume it can use the ... prove X. But since it is not decidable whether X can be proved , the validity of the larger proof in which it is ...
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