Skip to Main content Skip to Navigation
Conference papers

A Distributed and Clustering-Based Algorithm for the Enumeration Problem in Abstract Argumentation

Abstract : Computing acceptability semantics of abstract argumentation frameworks is receiving increasing attention. Large-scale instances, with a clustered structure, have shown particularly difficult to compute. This paper presents a distributed algorithm, AFDivider, that enumerates the acceptable sets under several labelling-based semantics. This algorithm starts with cutting the argumentation framework into clusters thanks to a spectral clustering method, before computing simultaneously in each cluster parts of the labellings. This algorithm is proven to be sound and complete for the stable, complete and preferred semantics, and empirical results are presented.
Complete list of metadata

Cited literature [37 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02419426
Contributor : Open Archive Toulouse Archive Ouverte (oatao) Connect in order to contact the contributor
Submitted on : Thursday, December 19, 2019 - 2:40:19 PM
Last modification on : Wednesday, June 9, 2021 - 10:00:28 AM
Long-term archiving on: : Friday, March 20, 2020 - 7:14:09 PM

File

doutre_25025.pdf
Files produced by the author(s)

Identifiers

Citation

Sylvie Doutre, Mickaël Lafages, Marie-Christine Lagasquie-Schiex. A Distributed and Clustering-Based Algorithm for the Enumeration Problem in Abstract Argumentation. 22nd International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2019), Oct 2019, Torino, Italy. pp.87-105, ⟨10.1007/978-3-030-33792-6_6⟩. ⟨hal-02419426⟩

Share

Metrics

Record views

130

Files downloads

343