Skip to Main content Skip to Navigation
Conference papers

Fuzzy Labeling for Abstract Argumentation: An Empirical Evaluation

Abstract : Argumentation frameworks have to be evaluated with respect to argumentation semantics to compute the set(s) of accepted arguments. In a previous approach, we proposed a fuzzy labeling algorithm for computing the (fuzzy) set of acceptable arguments, when the sources of the arguments in the argumentation framework are only partially trusted. The convergence of the algorithm was proved, and the convergence speed was estimated to be linear, as it is generally the case with iterative methods. In this paper, we provide an experimental validation of this algorithm with the aim of carrying out an empirical evaluation of its performance on a benchmark of argumentation graphs. Results show the satisfactory performance of our algorithm, even on complex graph structures as those present in our benchmark.
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01377557
Contributor : Andrea G. B. Tettamanzi <>
Submitted on : Friday, October 7, 2016 - 10:49:52 AM
Last modification on : Thursday, March 5, 2020 - 12:20:49 PM
Document(s) archivé(s) le : Friday, February 3, 2017 - 7:01:30 PM

File

SUM2016.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Célia da Costa Pereira, Mauro Dragoni, Andrea G. B. Tettamanzi, Serena Villata. Fuzzy Labeling for Abstract Argumentation: An Empirical Evaluation. Tenth International Conference on Scalable Uncertainty Management (SUM 2016) , Sep 2016, Nice, France. pp.126 - 139, ⟨10.1007/978-3-319-45856-4_9⟩. ⟨hal-01377557⟩

Share

Metrics

Record views

472

Files downloads

377