KR2025Proceedings of the 22nd International Conference on Principles of Knowledge Representation and ReasoningProceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning

Melbourne, Australia. November 11-17, 2025.

Edited by

ISSN: 2334-1033
ISBN: 978-1-956792-08-9

Sponsored by
Published by

Copyright © 2025 International Joint Conferences on Artificial Intelligence Organization

On Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation

  1. Matti Berthold(ScaDS.AI, Universität Leipzig)
  2. Lydia Blümel(Artificial Intelligence Group, University of Hagen)
  3. Anna Rapberger(Imperial College London)

Keywords

  1. Computational Argumentation
  2. Assumption-Based Argumentation
  3. Strong Admissibility
  4. Weak Admissibility

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.