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 40
Página 59
... theorems to axioms . This suggests that it would be much better to reason back- ward when trying to prove theorems . Mathematicians have long realized this [ Polya , 1957 ] , as have the designers of theorem - proving programs . One of ...
... theorems to axioms . This suggests that it would be much better to reason back- ward when trying to prove theorems . Mathematicians have long realized this [ Polya , 1957 ] , as have the designers of theorem - proving programs . One of ...
Página 167
... theorem proving that corresponds more closely to the processes used in human theorem proving . We are thus led to what we call , mostly by definition , natural deduction . Natural deduction is not a precise term . Rather it describes a ...
... theorem proving that corresponds more closely to the processes used in human theorem proving . We are thus led to what we call , mostly by definition , natural deduction . Natural deduction is not a precise term . Rather it describes a ...
Página 396
... theorems , that describe backward or goal - directed reasoning . An example of a consequent theorem is [ CONSEQUENT ( PART $ ? X $ ? Z ) ( GOAL ( PART $ ? X $ ? Y ) ) ( GOAL ( PART $ ? Y $ ? Z ) ) ] This theorem says that if you want to ...
... theorems , that describe backward or goal - directed reasoning . An example of a consequent theorem is [ CONSEQUENT ( PART $ ? X $ ? Z ) ( GOAL ( PART $ ? X $ ? Y ) ) ( GOAL ( PART $ ? Y $ ? Z ) ) ] This theorem says that if you want to ...
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