Minimal strong admissibility: a complexity analysis

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Dunne, Paul E. 2020. Minimal strong admissibility: a complexity analysis. Presented at: 8th International Conference on Computational Models of Argument (COMMA 2020), Perugia, Italy, 4-11 September 2020. Published in: Prakken, H., Bistarelli, S., Santini, F. and Taticchi, C. eds. Proceedings of COMMA 2020. Frontiers in Artificial Intelligence and Applications , vol.326 IOS Press, pp. 135-146. 10.3233/FAIA200499

Preview

PDF - Published Version Available under License Creative Commons Attribution Non-commercial. Download (318kB) | Preview

Abstract

The concept of strong admissibility plays an important rolein some of the dialectical proof procedures that have been stated forgrounded semantics. As the grounded extension is the (unique) biggeststrongly admissible set, to show that an argument is in the groundedextension it suffices to show that it is in a strongly admissible set. Weare interested in identifying a strongly admissible set that minimizes thenumber of steps needed in the associated dialectical proof procedure. Inthe current work, we look at the computational complexity of doing so.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Publisher:	IOS Press
ISBN:	9781643681061
Date of First Compliant Deposit:	10 July 2020
Date of Acceptance:	8 July 2020
Last Modified:	04 Sep 2025 13:15
URI:	https://orca.cardiff.ac.uk/id/eprint/133330

Citation Data

Cited 4 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item