Gradual Semantics Accounting for Varied-Strength Attacks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Gradual Semantics Accounting for Varied-Strength Attacks

Résumé

The paper studies how to evaluate arguments in graphs where both arguments and attacks are weighted. It proposes a broad family of gradual semantics that assign to each argument a numerical value representing its strength, i.e., how robust is the argument against attacks. It shows that five existing gradual semantics are instances of the family, and extends each of them in various ways for accounting for weights of attacks. The extended versions of each semantics differ in the way they deal with weights of attacks. Furthermore, they are all instances of the family. The paper shows also that the family captures additional semantics, like Euler-Max-based that is investigated in the paper. The new semantics are analyzed against properties from the literature and are compared with existing semantics that deal with weighted attacks.
Fichier principal
Vignette du fichier
AAMAS-19 (1).pdf (334.64 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-02325853 , version 1 (28-10-2019)

Identifiants

  • HAL Id : hal-02325853 , version 1

Citer

Leila Amgoud, Dragan Doder. Gradual Semantics Accounting for Varied-Strength Attacks. 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2019), IFAAMAS : International Foundation for Autonomous Agents and Multiagent Systems; SIGAI : ACM's Special Interest Group on Artificial Intelligence, May 2019, Montréal, Canada. pp.1270-1278. ⟨hal-02325853⟩
124 Consultations
106 Téléchargements

Partager

Gmail Facebook X LinkedIn More