Ranking-Based Semantics for Sets of Attacking Arguments
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.
Cite
Text
Yun et al. "Ranking-Based Semantics for Sets of Attacking Arguments." AAAI Conference on Artificial Intelligence, 2020. doi:10.1609/AAAI.V34I03.5697Markdown
[Yun et al. "Ranking-Based Semantics for Sets of Attacking Arguments." AAAI Conference on Artificial Intelligence, 2020.](https://mlanthology.org/aaai/2020/yun2020aaai-ranking/) doi:10.1609/AAAI.V34I03.5697BibTeX
@inproceedings{yun2020aaai-ranking,
title = {{Ranking-Based Semantics for Sets of Attacking Arguments}},
author = {Yun, Bruno and Vesic, Srdjan and Croitoru, Madalina},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2020},
pages = {3033-3040},
doi = {10.1609/AAAI.V34I03.5697},
url = {https://mlanthology.org/aaai/2020/yun2020aaai-ranking/}
}