The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
A procedural semantics for well-founded negation in logic programs
Journal of Logic Programming
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
On the equivalence of the static and disjunctive well-founded semantics and its computation
Theoretical Computer Science
On the partial semantics for disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
Journal of Automated Reasoning
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
A Top-Down Procedure for Disjunctive Well-Founded Semantics
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
| Hi-index | 0.00 |
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been 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 equivalently characterized by several different approaches including program transformations, argumentation, unfounded sets (and resolution-like procedure). We also provide a bottom-up procedure for this semantics. The significance of this work is not only in clarifying the relationship among different approaches, but also in providing novel arguments in favor of our semantics.