An Evaluation of Algorithms for Strong Admissibility

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.