Tractable algorithms for strong admissibility

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Harikrishnan, Sri 2024. Tractable algorithms for strong admissibility. Argument and Computation 10.3233/AAC-230012

PDF - Accepted Post-Print Version Download (565kB)

Abstract

Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded extension. As such, strongly admissible sets and labellings can be used as an explanation of membership of the grounded extension, as is for instance done in some of the proof procedures for grounded semantics. In the current paper, we present two polynomial algorithms for constructing relatively small strongly admissible labellings, with associated min–max numberings, for a particular argument. These labellings can be used as relatively small explanations for the argument’s membership of the grounded extension. Although our algorithms are not guaranteed to yield an absolute minimal strongly admissible labelling for the argument (as doing so would have implied an exponential complexity), our best performing algorithm yields results that are only marginally larger. Moreover, the runtime of this algorithm is an order of magnitude smaller than that of the existing approach for computing an absolute minimal strongly admissible labelling for a particular argument. As such, we believe that our algorithms can be of practical value in situations where the aim is to construct a minimal or near-minimal strongly admissible labelling in a time-efficient way.

Item Type:	Article
Date Type:	Published Online
Status:	In Press
Schools:	Computer Science & Informatics
Publisher:	IOS Press
ISSN:	1946-2174
Date of First Compliant Deposit:	21 March 2024
Date of Acceptance:	26 February 2024
Last Modified:	10 Nov 2024 09:00
URI:	https://orca.cardiff.ac.uk/id/eprint/167416

Actions (repository staff only)

Edit Item