Finding priorities of circumscription policy as a skeptical explanation in abduction

作     者：Wakaki, T SAtoh, K Nitta, K Sakurai, S 

作者机构：Tokyo Inst Technol Dept Comput Intelli & Syst Sci Yokohama Kanagawa 2268502 Japan 

出 版 物：《IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS》 (电子信息通信学会汇刊：信息与系统)

年 卷 期：1998年第E81D卷第10期

页      面：1111-1119页

核心收录：

学科分类：0810[工学-信息与通信工程] 08[工学] 0835[工学-软件工程] 081001[工学-通信与信息系统] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：skeptical explanations abductive framework circumscription policy parallel circumscription prioritized circumscription abductive logic programming extended logic programs answer set semantics 

摘      要：In the commonsense reasoning, priorities among rules are often required to be found out in order to derive the desired conclusion as a theorem of the reasoning. In this paper, first we present the bottom-up and top-down abduction procedures to compute skeptical explanations and secondly show that priorities of circumscription to infer a desired theorem can be abduced as a skeptical explanation in abduction. In our approach, the required priorities can be computed based on the procedure to compute skeptical explanations provided in this paper as well as Wakaki and Satoh s method of compiling circumscription into extended logic programs. The method, for example, enables us to automatically find the adequate priority w.r.t. the Yale Shooting Problem to express a human natural reasoning in the framework of circumscription.