Revisiting Approximate Reasoning based on Grounded Semantics
Résumé
Efficient computation of hard reasoning tasks is a key issue in abstract argumentation. One recent approach consists in defining ap- proximate algorithms, i.e. methods that provide an answer that may not always be correct, but outperforms the exact algorithms regarding the computation runtime. One such approach proposes to use the grounded semantics, which is polynomially computable, as a starting point for de- termining whether arguments are (credulously or skeptically) accepted with respect to various semantics. In this paper, we push further this idea by defining various approaches to evaluate the acceptability of ar- guments which are not in the grounded extension, neither attacked by it. We have implemented our approaches, and we describe the result of their empirical evaluation.
Fichier principal
Approximate_Reasoning_for_AFs___ECSQARU_2023-2.pdf (358.87 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|