Ideal Extensions as Logical Programming Models
2014 (English)In: Journal of logic and computation (Print), ISSN 0955-792X, E-ISSN 1465-363XArticle in journal (Refereed) Epub ahead of print
We show that the ideal sets of an argumentation framework can be characterized by two kinds of logical models: ideal models (2-valued logical models) and p-stable models (2-valued logical models). We also show that the maximal ideal set of an argumentation framework can be characterized by the well-founded+ model (a 3-valued logical model). These results argue for the logical foundations of the ideal sets of an argumentation framework. Moreover, these results consolidate the strong relationship between argumentation semantics and logic programming semantics with negation as failure. More accurately, we prove that the five argumentation semantics suggested by Dung etal, grounded, stable, preferred, complete and ideal semantics, can be characterized by the well-founded model, stable-model, p-stable, Clark's completion and well-founded+ model semantics, respectively by using a unique mapping from argumentation frameworks into logic programs. We observe that the labellings of these argumentation semantics can be inferred by the logical models of a logic program.
Place, publisher, year, edition, pages
Oxford University Press, 2014.
Argumentation semantics, Logic programming, non-monotonic reasoning
Research subject Computer Science; Mathematical Logic
IdentifiersURN: urn:nbn:se:umu:diva-87086DOI: 10.1093/logcom/exu014OAI: oai:DiVA.org:umu-87086DiVA: diva2:706093