An Evaluation of Algorithms for Strong Admissibility

Martin Caminada, Sri Harikrishnan

Publication: Chapter in book/Conference proceedingContribution to conference proceedings

Abstract

In the current paper, we evaluate the performance of different computational approaches for constructing a strongly admissible labelling for a particular argument. Unlike previous work, which examined different 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 fit for purpose.
Original languageEnglish
Title of host publicationProceedings of the 5th International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2024) co-located with 10th International Conference on Computational Models of Argument (COMMA 2024)
Subtitle of host publicationHagen, Germany, September 17th, 2024
Place of PublicationAachen
PublisherRWTH Aachen University
Pages69-82
Publication statusPublished - Sept 2024

Publication series

SeriesCEUR Workshop Proceedings
Volume3757
ISSN1613-0073

Cite this