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: 19th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2025, Hagen, Germany, 23 - 26 September 2025. Published in: Sauerwald, Kai and Thimm, Matthias eds. Symbolic and Quantitative Approaches to Reasoning with Uncertainty 18th European Conference, ECSQARU 2025, Hagen, Germany, September 23–26, 2025, Proceedings. Lecture Notes in Computer Science (16099) Cham, Switzerland: Springer, pp. 424-436. 10.1007/978-3-032-05134-9_29

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution. Download (814kB)

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 - published (Paper)
Date Type:	Published Online
Status:	Published
Schools:	Schools > Computer Science & Informatics
Publisher:	Springer
ISBN:	9783032051332
Date of First Compliant Deposit:	29 August 2025
Date of Acceptance:	24 August 2025
Last Modified:	05 Feb 2026 15:46
URI:	https://orca.cardiff.ac.uk/id/eprint/180738

Actions (repository staff only)

Edit Item