Comparisons and computation of well-founded semantics for disjunctive logic programs

作     者：Wang, Kewen Zhou, Lizhu 

作者机构：Griffith University Tsinghua University Sch. of Comp. and Info. Technology Griffith University QLD 4111 Australia 

出 版 物：《ACM Transactions on Computational Logic》 (ACM Trans. Comput. Log.)

年 卷 期：2005年第6卷第2期

页      面：295-327页

核心收录：

学科分类：1205[管理学-图书情报与档案管理] 08[工学] 0835[工学-软件工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Logic programming 

摘      要：Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which semantics is the most intended. In this article, we look at disjunctive well-founded reasoning from different angles. We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be characterized by slightly modifying some existing approaches to defining disjunctive well-founded semantics, including program transformations, argumentation, unfounded sets (and resolution-like procedure). By employing the techniques developed by Brass and Dix in their transformation-based approach, we also provide a bottom-up procedure for this semantics. The significance of our work is not only in clarifying the relationship among different approaches, but also shed some light on what is an intended well-founded semantics for disjunctive logic programs. © 2005 ACM.