On Independence and SCC-Recursiveness in Assumption-Based Argumentation (Full Version)
Year: 2025
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.
Authors: Blümel, Lydia, Rapberger, Anna, Thimm, Matthias, Toni, Francesca
Institutions: FernUniversität in Hagen, Imperial College London
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6893278306
FWCI:
Cites:
Cited by:
Related to: