Ranking-Based Semantics for Sets of Attacking Arguments

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 rankingbased 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 hcategoriser.

Authors

• Bruno Yun Universite Claude Bernard Lyon 1, CNRS, Ecole Centrale de Lyon, INSA Lyon, Université Lumière Lyon 2, LIRIS, UMR5205
• Srdjan Vesic CRIL, CNRS, Univ Artois
• Madalina Croitoru

Keywords

No keywords are indexed for this paper.