umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Ideal Extensions as Logical Programming Models
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2016 (English)In: Journal of logic and computation (Print), ISSN 0955-792X, E-ISSN 1465-363X, Vol. 26, no 5, 1361-1393 p.Article in journal (Refereed) Published
Abstract [en]

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, 2016. Vol. 26, no 5, 1361-1393 p.
Keyword [en]
Argumentation semantics, Logic programming, non-monotonic reasoning
National Category
Computer Systems
Research subject
Computer Science; Mathematical Logic
Identifiers
URN: urn:nbn:se:umu:diva-87086DOI: 10.1093/logcom/exu014ISI: 000386155200001OAI: oai:DiVA.org:umu-87086DiVA: diva2:706093
Available from: 2014-03-18 Created: 2014-03-18 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Nieves, Juan Carlos
By organisation
Department of Computing Science
In the same journal
Journal of logic and computation (Print)
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 280 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf