A Top-Down Procedure for Disjunctive Well-Founded Semantics

Authors:
Kewen Wang
Affiliations:
-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 8
Cited 3

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
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
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

A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Comparisons and computation of well-founded semantics for disjunctive logic programs

ACM Transactions on Computational Logic (TOCL)
Optimization of bound disjunctive queries with constraints

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming is usually named well-founded semantics. However, the issue of defining and computing the well-founded semantics for disjunctive programs and databases has proved to be far more complex and difficult than for normal logic programs. The argumentation-based semantics WFDS is among the most promising proposals that attempts to define a natural well-founded semantics for disjunctive programs. In this paper, we propose a top-down procedure for WFDS called D-SLS Resolution, which naturally extends the Global SLS-resolution and SLI-resolution. We prove that D-SLS Resolution is sound and complete with respect to WFDS. This result in turn provides a further yet more powerful argument in favor of the WFDS.