Well-Founded Argumentation Semantics for Extended Logic Programming

Simple item page
dc.creatorSchweimeier, Ralf
dc.creatorSchroeder, Michael
dc.date2002-07-10
dc.date.accessioned2026-07-07T03:18:38Z
dc.date.available2026-07-07T03:18:38Z
dc.descriptionThis 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.
dc.descriptionWorkshop on Non-Monotonic Reasoning NMR'02, Special Session on Argument, Dialogue, and Decision
dc.identifierhttps://arxiv.org/abs/cs/0207040
dc.identifierhttp://arxiv.org/abs/cs/0207040
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31194
dc.subjectLogic in Computer Science
dc.subjectArtificial Intelligence
dc.subjectD.1.6.; F.3.2.; I.2.3.; I.2.4
dc.titleWell-Founded Argumentation Semantics for Extended Logic Programming
dc.typetext

Files

Collections

arXiv