Ranking-Based Semantics for Sets of Attacking Arguments

Authors: Bruno Yun, Srdjan Vesic, Madalina Croitoru3033-3040

AAAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical 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.
Researcher Affiliation Academia Bruno Yun,1 Srdjan Vesic,2 Madalina Croitoru3 1University of Aberdeen, Scotland 2CRIL CNRS, Univ. Artois, France 3University of Montpellier, France
Pseudocode No The paper defines the nh-categoriser using a mathematical formula but does not provide pseudocode or an algorithm block.
Open Source Code No The paper does not contain any explicit statements about releasing source code or links to a code repository.
Open Datasets No The paper is theoretical and focuses on mathematical definitions, properties, and proofs. It does not mention the use of any datasets for training or evaluation.
Dataset Splits No The paper is theoretical and does not involve experiments with datasets, thus no training, validation, or test splits are discussed.
Hardware Specification No The paper is theoretical and does not describe any experimental setup that would require hardware specifications.
Software Dependencies No The paper is theoretical and does not mention any specific software dependencies with version numbers.
Experiment Setup No The paper focuses on theoretical definitions, properties, and proofs of a new semantics. It does not describe an experimental setup, hyperparameters, or training configurations.