• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

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

Thumbnail
Date
2014
Link to item file
http://arxiv.org/abs/1402.6109v1
Dewey
Principes généraux des mathématiques
Sujet
semantic; dynamic argumentation; abstract argumentation
JEL code
C.C0.C02
DOI
http://dx.doi.org/10.1007/978-3-642-54373-9_11
Conference name
Theory and Applications of Formal Argumentation; Second International Workshop, TAFA 2013
Conference date
08-2013
Conference city
Beijing
Conference country
China
Book title
Theory and Applications of Formal Argumentation; Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers
Author
Black, Elizabeth; Modgil, Sanjay; Oren, Nir
Publisher
Springer
Publisher city
Berlin
Year
2014
Pages number
209
ISBN
978-3-642-54372-2
Book URL
10.1007/978-3-642-54373-9
URI
https://basepub.dauphine.fr/handle/123456789/15896
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Kim, Eun Jung
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ordyniak, Sebastian
88655 Masaryk University
Szeider, Stefan
219118 Institute of Information Systems
Type
Communication / Conférence
Item number of pages
158-175
Abstract (EN)
We 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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.