This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://purl.org/net/nknouf/ns/bibtex#
n10http://localhost/temp/predkladatel/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n18http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F14%3A00075259%21RIV15-MSM-14330___/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F14%3A00075259%21RIV15-MSM-14330___
rdf:type
n15:Vysledek skos:Concept
dcterms: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 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 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. 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 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.
dcterms:title
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
skos:prefLabel
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
skos:notation
RIV/00216224:14330/14:00075259!RIV15-MSM-14330___
n4:aktivita
n19:P
n4:aktivity
P(EE2.3.30.0009)
n4:dodaniDat
n13:2015
n4:domaciTvurceVysledku
Ordyniak, Sebastian
n4:druhVysledku
n7:D
n4:duvernostUdaju
n16:S
n4:entitaPredkladatele
n20:predkladatel
n4:idSjednocenehoVysledku
8384
n4:idVysledku
RIV/00216224:14330/14:00075259
n4:jazykVysledku
n9:eng
n4:klicovaSlova
abstract argumentation; dynamic argumentation; parameterized complexity
n4:klicoveSlovo
n5:abstract%20argumentation n5:parameterized%20complexity n5:dynamic%20argumentation
n4:kontrolniKodProRIV
[93E454E79161]
n4:mistoKonaniAkce
Bejing
n4:mistoVydani
Lecture Notes in Computer Science
n4:nazevZdroje
Lecture Notes in Computer Science
n4:obor
n11:BD
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:projekt
n6:EE2.3.30.0009
n4:rokUplatneniVysledku
n13:2014
n4:tvurceVysledku
Eun Jung, Kim Ordyniak, Sebastian Szeider, Stefan
n4:typAkce
n17:WRD
n4:zahajeniAkce
2013-01-01+01:00
s:issn
0302-9743
s:numberOfPages
18
n18:doi
10.1007/978-3-642-54373-9_11
n12:hasPublisher
Springer-Verlag
n21:isbn
9783642543722
n10:organizacniJednotka
14330