Ranking-Based Semantics for Sets of Attacking Arguments

Bruno Yun 1 Srdjan Vesic 2 Madalina Croitoru 3
3 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Argumentation is a process of evaluating and comparing sets of arguments. Ranking-based semantics received a lot of attention recently. All of the semantics introduced so far are applicable to binary attack relations. In this paper, we study a more general case when sets of arguments can jointly attack an argument. We generalise existing postulates for ranking-based semantics to fit this framework, define a general variant of h-categoriser, prove that it converges for every argumentation framework and study the postulates it satisfies. We also study the link between binary and hypergraph version of h-categoriser.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02374712
Contributor : Bruno Yun <>
Submitted on : Thursday, November 21, 2019 - 4:06:43 PM
Last modification on : Tuesday, November 26, 2019 - 12:00:42 PM

File

cr-aaai.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-02374712, version 1

Citation

Bruno Yun, Srdjan Vesic, Madalina Croitoru. Ranking-Based Semantics for Sets of Attacking Arguments. The Thirty-Fourth AAAI Conference on Artificial Intelligence, Feb 2020, New York, United States. ⟨lirmm-02374712⟩

Share

Metrics

Record views

63

Files downloads

75