Well-Founded Argumentation Semantics for Extended Logic Programming

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Logic in Computer Science, Artificial Intelligence, D.1.6.; F.3.2.; I.2.3.; I.2.4

Citation

URI

https://dspace.dare.co.zw/handle/123456789/42396

Collections

arXiv

Endorsement

Review

Supplemented By

Referenced By