Ranking arguments with compensation-based semantics - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Ranking arguments with compensation-based semantics

Résumé

In almost all existing semantics in argumentation, a strong attack has a lethal effect on its target that a set of several weak attacks may not have. This paper investigates the case where several weak attacks may compensate one strong attack. It defines a broad class of ranking semantics, called alpha-OBBS, which satisfy compensation. alpha-OBBS assign a burden number to each argument and order the arguments with respect to those numbers. We study formal properties of alpha-OBBS, implement an algorithm that calculates the ranking, and perform experiments that show that the approach computes the ranking very quickly. Moreover, an approximation of the ranking can be provided at any time.
Fichier principal
Vignette du fichier
amgoud_16945.pdf (327.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01530417 , version 1 (31-05-2017)

Identifiants

  • HAL Id : hal-01530417 , version 1
  • OATAO : 16945

Citer

Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, Srdjan Vesic. Ranking arguments with compensation-based semantics. 15th International Conference on Principles of Knowledge Representation and Reasoning (KR&R 2016), Apr 2016, Cap Town, South Africa. pp.12-21. ⟨hal-01530417⟩
316 Consultations
139 Téléchargements

Partager

Gmail Facebook X LinkedIn More