Minimal Strong Admissibility: A Complexity Analysis

Caminada, Martin and Dunne, Paul E ORCID: 0000-0002-6033-3742 (2020) Minimal Strong Admissibility: A Complexity Analysis. In: 8th International Conference on Computational Models of Argument, 2020-9-8 - 2020-9-11, Perugia, Italy (will be online due to COVID).

Text COMMA_2020_paper_25.pdf - Author Accepted Manuscript Download (288kB) | Preview

Abstract

The concept of strong admissibility plays an important role in some of the dialectical proof procedures that have been stated for grounded semantics. As the grounded extension is the (unique) biggest strongly admissible set, to show that an argument is in the grounded extension it suffices to show that it is in a strongly admissible set. We are interested in identifying a strongly admissible set that minimizes the number of steps needed in the associated dialectical proof procedure. In the current work, we look at the computational complexity of doing so.

Item Type:	Conference or Workshop Item (Unspecified)
Uncontrolled Keywords:	strong admissibility, computational complexity, explainable AI
Depositing User:	Symplectic Admin
Date Deposited:	07 Jul 2020 08:55
Last Modified:	21 Aug 2023 13:18
DOI:	10.3233/FAIA200499
Related URLs:	Author
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3092253