Show simple item record

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorKim, Eun Jung
hal.structure.identifier
dc.contributor.authorOrdyniak, Sebastian
hal.structure.identifierInstitute of Information Systems
dc.contributor.authorSzeider, Stefan
dc.date.accessioned2016-10-26T13:54:28Z
dc.date.available2016-10-26T13:54:28Z
dc.date.issued2014
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/15896
dc.language.isoenen
dc.subjectsemanticen
dc.subjectdynamic argumentationen
dc.subjectabstract argumentationen
dc.subject.ddc511en
dc.subject.classificationjelC.C0.C02en
dc.titleThe Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentationen
dc.typeCommunication / Conférence
dc.description.abstractenWe study the computational complexity of problems that arise in abstract argumentation in the context of dynamic argumentation, minimal change, and aggregation. In particular, we consider the following problems where always an argumentation framework F and a small positive integer k are given. The Repair problem asks whether a given set of arguments can be modified into an extension by at most k elementary changes (i.e., the extension is of distance k from the given set). The Adjust problem asks whether a given extension can be modified by at most k elementary changes into an extension that contains a specified argument. The Center problem asks whether, given two extensions of distance k, whether there is a “center” extension that is of distance at most k − 1 from both given extensions. We study these problems in the framework of parameterized complexity, and take the distance k as the parameter. Our results cover several different semantics, including admissible, complete, preferred, semi-stable and stable semantics.en
dc.identifier.citationpages158-175en
dc.relation.ispartoftitleTheory and Applications of Formal Argumentation; Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papersen
dc.relation.ispartofeditorBlack, Elizabeth
dc.relation.ispartofeditorModgil, Sanjay
dc.relation.ispartofeditorOren, Nir
dc.relation.ispartofpublnameSpringeren
dc.relation.ispartofpublcityBerlinen
dc.relation.ispartofdate2014
dc.relation.ispartofpages209en
dc.relation.ispartofurl10.1007/978-3-642-54373-9en
dc.identifier.urlsitehttp://arxiv.org/abs/1402.6109v1en
dc.subject.ddclabelPrincipes généraux des mathématiquesen
dc.relation.ispartofisbn978-3-642-54372-2en
dc.relation.conftitleTheory and Applications of Formal Argumentation; Second International Workshop, TAFA 2013en
dc.relation.confdate2013-08
dc.relation.confcityBeijingen
dc.relation.confcountryChinaen
dc.relation.forthcomingnonen
dc.identifier.doi10.1007/978-3-642-54373-9_11en
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2016-07-06T15:07:59Z
hal.identifierhal-01388176*
hal.version1*
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record