The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00075259" target="_blank" >RIV/00216224:14330/14:00075259 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-54373-9_11" target="_blank" >http://dx.doi.org/10.1007/978-3-642-54373-9_11</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-54373-9_11" target="_blank" >10.1007/978-3-642-54373-9_11</a>
Alternative languages
Result language
angličtina
Original language name
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
Original language description
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 whethera 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 a 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/EE2.3.30.0009" target="_blank" >EE2.3.30.0009: Employment of Newly Graduated Doctors of Science for Scientific Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science
ISBN
9783642543722
ISSN
0302-9743
e-ISSN
—
Number of pages
18
Pages from-to
158-175
Publisher name
Springer
Place of publication
Lecture Notes in Computer Science
Event location
Bejing
Event date
Jan 1, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—