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
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Relating defeasible and normal logic programming through transformation properties
Theoretical Computer Science
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
Annals of Mathematics and Artificial Intelligence
Semantic forgetting in answer set programming
Artificial Intelligence
Forgetting and conflict resolving in disjunctive logic programming
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Discovering classes of strongly equivalent logic programs
Journal of Artificial Intelligence Research
Sound and complete inference rules for SE-consequence
Journal of Artificial Intelligence Research
Discovering classes of strongly equivalent logic programs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A purely model-theoretic semantics for disjunctive logic programs with negation
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Complexity of rule redundancy in non-ground answer-set programming over finite domains
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Well-founded semantics for description logic programs in the semantic web
ACM Transactions on Computational Logic (TOCL)
Unfounded sets for disjunctive logic programs with arbitrary aggregates
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Analysing and extending well-founded and partial stable semantics using partial equilibrium logic
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.02 |
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.