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 64
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
addition algorithm already answer appear applied approach appropriate Artificial Intelligence attempt better block called Chapter choose clauses combined complete concept consider contains corresponding dependency described discussed domain example exploit explore fact frame function given goal grammar graph heuristic important indicates initial input interpretation involved John kinds knowledge labelings language learning logic look machine Marcus match means methods move natural necessary node objects occur operators particular path patterns perform position possible predicate present problem procedure produce prove question reasoning representation represented result rules satisfied script selected semantic sentence shown in Figure shows simple single situation solution solve space specific stack statement step stored structure Suppose task techniques things tion tree true understanding variety