Fast Computing of Dung Semantics in Acyclic Probabilistic Argumentation Frameworks - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2025

Fast Computing of Dung Semantics in Acyclic Probabilistic Argumentation Frameworks

Résumé

This paper presents fast and exact methods for computing the probability of an argument's acceptance using Dung's semantics in the Constellation paradigm of Abstract Argumentation. For (directed) Singly-Connected Graphs (SCGs), the problem can now be solved in linearithmic time instead of being exponential in the number of attacks, as reported in the literature. Moreover, in the more general case of Directed Acyclic Graphs (DAGs), we provide an algorithm whose time complexity is linearithmic in the product of the out-degree of dependent arguments, i.e., arguments reaching the argument considered for acceptance through multiple paths in the graph. We theoretically show that this complexity is lower than the lower-bound of the (exact) Constellation method, which is also supported by empirical results. We also compare our approach on DAGs with the (approximate) Monte-Carlo method, which is stopped when our approach obtains the exact results. Within this time constraint, Monte-Carlo still outputs significant errors, underlying the fast computation of our approach.
Fichier principal
Vignette du fichier
AAAI_2025_Fast_DAG.pdf (569.33 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04876258 , version 1 (09-01-2025)

Licence

Identifiants

  • HAL Id : hal-04876258 , version 1

Citer

Stefano Bistarelli, Victor David, Pierre Monnin, Francesco Santini, Carlo Taticchi. Fast Computing of Dung Semantics in Acyclic Probabilistic Argumentation Frameworks. The 39th Annual AAAI Conference on Artificial Intelligence (AAAI 2025), Feb 2025, Philadelphia, United States. ⟨hal-04876258⟩
0 Consultations
0 Téléchargements

Partager

More