Well-Founded Argumentation Semantics for Extended Logic Programming

Abstract

This paper defines an argumentation semantics for extended logic programming and shows its equivalence to the well-founded semantics with explicit negation. We set up a general framework in which we extensively compare this semantics to other argumentation semantics, including those of Dung, and Prakken and Sartor. We present a general dialectical proof theory for these argumentation semantics.

Workshop on Non-Monotonic Reasoning NMR'02, Special Session on Argument, Dialogue, and Decision