Sciweavers

Share
CADE
2001
Springer

A Top-Down Procedure for Disjunctive Well-Founded Semantics

10 years 6 months ago
A Top-Down Procedure for Disjunctive Well-Founded Semantics
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.
Kewen Wang
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2001
Where CADE
Authors Kewen Wang
Comments (0)
books