TY - GEN
T1 - Computing the grounded semantics in all the subgraphs of an argumentation framework
T2 - 14th International Workshop on Computational Logic in Multi-Agent Systems, CLIMA 2013
AU - Dondio, Pierpaolo
PY - 2013
Y1 - 2013
N2 - Given an argumentation framework AF = (Ar, R) - with Ar a finite set of arguments and R ⊆ Ar x Ar the attack relation identifying the graph G - we study how the grounded labelling of a generic argument a ∈ Ar varies in all the subgraphs of G. Since this is an intractable problem of above-polynomial complexity, we present two non-naïve algorithms to find the set of all the subgraphs where the grounded semantic assigns to argument a specific label l ∈ {in, out, undec}. We report the results of a series of empirical tests over graphs of increasing complexity. The value of researching the above problem is two-fold. First, knowing how an argument behaves in all the subgraphs represents strategic information for arguing agents. Second, the algorithms can be applied to the computation of the recently introduced probabilistic argumentation frameworks.
AB - Given an argumentation framework AF = (Ar, R) - with Ar a finite set of arguments and R ⊆ Ar x Ar the attack relation identifying the graph G - we study how the grounded labelling of a generic argument a ∈ Ar varies in all the subgraphs of G. Since this is an intractable problem of above-polynomial complexity, we present two non-naïve algorithms to find the set of all the subgraphs where the grounded semantic assigns to argument a specific label l ∈ {in, out, undec}. We report the results of a series of empirical tests over graphs of increasing complexity. The value of researching the above problem is two-fold. First, knowing how an argument behaves in all the subgraphs represents strategic information for arguing agents. Second, the algorithms can be applied to the computation of the recently introduced probabilistic argumentation frameworks.
KW - Algorithms
KW - Argumentation Theory
KW - Semantics
UR - http://www.scopus.com/inward/record.url?scp=84886377932&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-40624-9_8
DO - 10.1007/978-3-642-40624-9_8
M3 - Conference contribution
AN - SCOPUS:84886377932
SN - 9783642406232
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 119
EP - 137
BT - Computational Logic in Multi-Agent Systems - 14th International Workshop, CLIMA 2013, Proceedings
Y2 - 16 September 2013 through 18 September 2013
ER -