Strong admissibility and infinite argumentation frameworks

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 2025. Strong admissibility and infinite argumentation frameworks. Presented at: ECSQARU, Hagen, Germany, 23-26 September 2025. Published in: Sauerwald, Kai and Thimm, Matthias eds. Proceedings of the 18th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty. Springer, Item availability restricted.

PDF - Accepted Post-Print Version Restricted to Repository staff only until 27 September 2025 due to copyright restrictions. Download (437kB)

Abstract

Strong admissibility plays an important role in formal argumentation under the grounded semantics, especially when explaining the acceptance of an argument. However, strong admissibility has so far only been defined in the context of finite argumentation frameworks. In the current paper, we examine the case of infinite argumentation frameworks. In particular, we assess what the challenges are when moving from finite to infinite argumentation frameworks and we show that despite these challenges, strong admissibility can be meaningfully defined and applied in the context of finitary argumentation frameworks.

Item Type:	Conference or Workshop Item (Paper)
Status:	In Press
Schools:	Schools > Computer Science & Informatics
Publisher:	Springer
ISSN:	0302-9743
Date of First Compliant Deposit:	11 July 2025
Date of Acceptance:	9 July 2025
Last Modified:	17 Jul 2025 14:15
URI:	https://orca.cardiff.ac.uk/id/eprint/179759

Actions (repository staff only)

Edit Item