Well-Founded Argumentation Semantics for Extended Logic Programming
Logic in Computer Science
2007-05-23 v1 Artificial Intelligence
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.
Cite
@article{arxiv.cs/0207040,
title = {Well-Founded Argumentation Semantics for Extended Logic Programming},
author = {Ralf Schweimeier and Michael Schroeder},
journal= {arXiv preprint arXiv:cs/0207040},
year = {2007}
}
Comments
Workshop on Non-Monotonic Reasoning NMR'02, Special Session on Argument, Dialogue, and Decision