An evaluation of algorithms for strong admissibility

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Harikrishnan, Sri 2024. An evaluation of algorithms for strong admissibility. Presented at: The Fifth International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2024), Hagen, Germany, 17 September 2024. CEUR Workshop Proceedings. , vol.SAFA24 pp. 69-82.

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (2MB) | Preview

Abstract

In the current paper, we evaluate the performance of di!erent computational approaches for constructing a strongly admissible labelling for a particular argument. Unlike previous work, which examined di!erent approaches for constructing a small strongly admissible labelling for a particular argument, in the current paper we are interested in constructing an arbitrary strongly admissible labelling for a particular argument, without any constraints regarding the size of such a labelling. A strongly admissible labelling relies on its associated min-max numbering to show that it is actually strongly admissible. As such, we also examine the additional computational costs of constructing such a min-max numbering. Overall, our analysis leads to a clear recommendation regarding which of the current computational approaches is best "t for purpose.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
ISSN:	1613-0073
Date of First Compliant Deposit:	2 October 2024
Date of Acceptance:	9 August 2024
Last Modified:	03 Oct 2024 10:34
URI:	https://orca.cardiff.ac.uk/id/eprint/172521

Actions (repository staff only)

Edit Item