Skip to Main content Skip to Navigation
Conference papers

A Distributed and Clustering-based Algorithm for the Enumeration Problem in Abstract Argumentation (JIAF 2020)

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

https://hal.archives-ouvertes.fr/hal-02889413
Contributor : Marie-Christine Lagasquie-Schiex Connect in order to contact the contributor
Submitted on : Wednesday, March 31, 2021 - 3:12:46 PM
Last modification on : Wednesday, June 9, 2021 - 10:00:28 AM
Long-term archiving on: : Thursday, July 1, 2021 - 6:49:40 PM

File

A Distributed and Clustering-b...
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-02889413, version 1

Citation

Sylvie Doutre, Mickaël Lafages, Marie-Christine Lagasquie-Schiex. A Distributed and Clustering-based Algorithm for the Enumeration Problem in Abstract Argumentation (JIAF 2020). 14èmes Journées d’Intelligence Artificielle Fondamentale (JIAF 2020), AFIA, 2020, Angers, France. pp.99-108. ⟨hal-02889413⟩

Share

Metrics

Record views

67

Files downloads

19