On Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation
Open Access
- 1 November 2025
- conference paper
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 22 (1) , 137-147
Abstract
In this work, we broaden the investigation of admissibility notions in the context of assumption-based argumentation (ABA). More specifically, we study two prominent alternatives to the standard notion of admissibility from abstract argumentation, namely strong and weak admissibility, and introduce the respective preferred, complete and grounded semantics for general (sometimes called non-flat) ABA. To do so, we use abstract bipolar set-based argumentation frameworks (BSAFs) as formal playground since they concisely capture the relations between assumptions and are expressive enough to represent general non-flat ABA frameworks, as recently shown. While weak admissibility has been recently investigated for a restricted fragment of ABA in which assumptions cannot be derived (flat ABA), strong admissibility has not been investigated for ABA so far. We introduce strong admissibility for ABA and investigate desirable properties. We furthermore extend the recent investigations of weak admissibility in the flat ABA fragment to the non-flat case. We show that the central modularization property is maintained under classical, strong, and weak admissibility. We also show that strong and weakly admissible semantics in non-flat ABA share some of the shortcomings of standard admissible semantics and discuss ways to address these.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Defining defense and defeat in abstract argumentation from scratch – A generalizing approachArtificial Intelligence, 2025
- Principles and their Computational Consequences for Argumentation Frameworks with Collective AttacksJournal of Artificial Intelligence Research, 2024
- Shedding new light on the foundations of abstract argumentation: Modularization and weak admissibilityArtificial Intelligence, 2022
- A Labelling Semantics and Strong Admissibility for Weighted Argumentation FrameworksJournal of Logic and Computation, 2022
- Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based ArgumentationTheory and Practice of Logic Programming, 2021
- Revisiting the Foundations of Abstract Argumentation – Semantics Based on Weak Admissibility and Weak DefenseProceedings of the AAAI Conference on Artificial Intelligence, 2020
- On bipolarity in argumentation frameworksInternational Journal of Intelligent Systems, 2008
- On principle-based evaluation of extension-based argumentation semanticsArtificial Intelligence, 2007
- An abstract, argumentation-theoretic approach to default reasoningArtificial Intelligence, 1997
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamesArtificial Intelligence, 1995