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
Complete Extensions as Clark's Completion Semantics
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2013 (English)In: 2013 MEXICAN INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE (ENC 2013), IEEE, 2013, p. 81-88Conference paper, Published paper (Refereed)
Abstract [en]

According to Dung, the sets of arguments which can be considered as admissible from an argumentation framework can be regarded as logical models of a given logic program. Clark's completions defines a basic logic programming semantics which has influenced modern non-monotonic semantics such as Answer Set Semantics. The Complete Semantics is a fundamental argumentation semantics which identifies a set of admissible sets which contains the grounded, stable, preferred and ideal semantics. In this paper we introduce a characterization of the complete semantics in terms of logical models using Clark's completions. Given that we use a unique mapping which characterizes the grounded, stable, preferred and ideal semantics, our characterization argues for a strong bridge between argumentation semantics and logic programming semantics with negation as failure. This paper also seeks to draw attention to the correspondence between the complete semantics of argumentation frameworks and models of Clark's completion, since this correspondence also allows us to identify the possibility of computing argumentation frameworks based on integer programming.

Place, publisher, year, edition, pages
IEEE, 2013. p. 81-88
Series
Proceedings of the Mexican Conference on Computer Science, ISSN 1550-4069
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:umu:diva-142775DOI: 10.1109/ENC.2013.18ISI: 000332889700013ISBN: 978-0-7695-5087-9 (print)OAI: oai:DiVA.org:umu-142775DiVA, id: diva2:1166643
Conference
Mexican International Conference on Computer Science (ENC), OCT 30-NOV 01, 2013, Morelia, MEXICO
Available from: 2017-12-15 Created: 2017-12-15 Last updated: 2018-11-01Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Nieves, Juan Carlos

Search in DiVA

By author/editor
Nieves, Juan Carlos
By organisation
Department of Computing Science
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 12 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