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

There are no files associated with this record.

Title Comparisons and computation of well-founded semantics for disjunctive logic programs
Author Wang, Kewen; Zhou, Lizhu
Journal Name ACM Transactions on Computational Logic
Year Published 2005
Place of publication USA
Publisher ACM
Abstract 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 paper 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.
Peer Reviewed Yes
Published Yes
Volume 6
Issue Number 2
Page from 295
Page to 327
ISSN 1529-3785
Date Accessioned 2006-01-05
Date Available 2007-03-19T21:51:17Z
Language en_AU
Research Centre Institute for Integrated and Intelligent Systems
Faculty Faculty of Engineering and Information Technology
Subject Other Artificial Intelligence
URI http://hdl.handle.net/10072/4294
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1

Show simple item record

Griffith University copyright notice