On independence and SCC-recursiveness in assumption-based argumentation
File(s)
Published version
Author(s)
Blümel, Lydia
Rapberger, Anna
Thimm, Matthias
Toni, Francesca
Type
Conference Paper
Abstract
We introduce a notion of conditional independence in (flat) assumption-based argumentation (ABA), where independence between (sets of) assumptions amounts to the presence of information about one set of assumptions not impacting the acceptability of another. We study general properties, computational complexity, and the relation to independence in abstract argumentation. In light of the high computational complexity of deciding independence, we introduce sound methods for checking independence in polynomial time via two different routes: the first utilizes the strongly connected components (SCCs) of the instantiated abstract argumentation framework; the second exploits the structure of the ABA framework directly. Along the way, we introduce the notion of SCC-recursiveness for ABA.
Date Issued
2025-09-01
Date Acceptance
2025-08-01
Citation
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025, pp.4382-4390
ISSN
1045-0823
Publisher
International Joint Conferences on Artificial Intelligence Organization
Start Page
4382
End Page
4390
Journal / Book Title
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence
Copyright Statement
© 2025 The Author(s).
Identifier
10.5281/zen-
Source
Thirty-Fourth International Joint Conference on Artificial Intelligence {IJCAI-25}
Publication Status
Published
Start Date
2025-08-16
Finish Date
2025-08-22
Coverage Spatial
Montreal, Canada