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 37
Página 48
... proof and check it to make sure it is correct . Alternatively , finding a proof of the theorem might be sufficiently difficult that the program does not know where to start . At the moment , people are still better at doing the high ...
... proof and check it to make sure it is correct . Alternatively , finding a proof of the theorem might be sufficiently difficult that the program does not know where to start . At the moment , people are still better at doing the high ...
Página 148
... proofs such as these may not be easy . In the next section , we will introduce a proof procedure called resolution that reduces some of the complexity because it operates on statements that have first been converted to a single ...
... proofs such as these may not be easy . In the next section , we will introduce a proof procedure called resolution that reduces some of the complexity because it operates on statements that have first been converted to a single ...
Página 180
... proofs that depend on it must be thrown away , then all proofs that depend on the statements whose proofs have just been discarded ( and for which no other proof can be found ) must be thrown away , and so forth . In designing ...
... proofs that depend on it must be thrown away , then all proofs that depend on the statements whose proofs have just been discarded ( and for which no other proof can be found ) must be thrown away , and so forth . In designing ...
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