Document Type
Article
Rights
Available under a Creative Commons Attribution Non-Commercial Share Alike 4.0 International Licence
Disciplines
Computer Sciences
Abstract
Given an argumentation framework – with a finite set of arguments and the attack relation identifying the graph – we study how the grounded labelling of a generic argument a varies in all the subgraphs of . 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 . 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.
DOI
https://doi.org/10.1007/978-3-642-40624-9_8
Recommended Citation
Pierpaolo D.: Computing the Grounded Semantics in all the Subgraphs of an Argumentation Framework: an Empirical Evaluation. CLIMA, XIV Workshop on Computational Logic in Multi-Agent Systems, Lecture Notes in Artificial Intelligence, Springer, 2013. doi:10.1007/978-3-642-40624-9_8
Funder
School of Computing
Publication Details
Lecture Notes in Artificial Intelligence, Springer, September 2013