![[2602.13135] Constrained Assumption-Based Argumentation Frameworks](https://arxiv.org/static/browse/0.3.4/images/arxiv-logo-fb.png){kind=logo}
[2602.13135] Constrained Assumption-Based Argumentation Frameworks
Summary
This paper introduces Constrained Assumption-Based Argumentation (CABA), extending traditional Assumption-Based Argumentation frameworks by allowing constrained variables, thus enhancing their applicability in structured argumentation.
Why It Matters
The development of CABA frameworks addresses limitations in existing argumentation models by incorporating variables that can range over infinite domains. This advancement is significant for researchers and practitioners in artificial intelligence, particularly in fields requiring nuanced reasoning and argumentation.
Key Takeaways
- CABA frameworks allow for the inclusion of constrained variables in argumentation.
- The paper defines non-ground semantics for CABA, broadening the scope of traditional ABA.
- New semantics conservatively generalize standard ABA semantics, enhancing their applicability.
Computer Science > Artificial Intelligence arXiv:2602.13135 (cs) [Submitted on 13 Feb 2026] Title:Constrained Assumption-Based Argumentation Frameworks Authors:Emanuele De Angelis (1), Fabio Fioravanti (2), Maria Chiara Meo (2), Alberto Pettorossi (3), Maurizio Proietti (1), Francesca Toni (4) ((1) CNR-IASI, Rome, Italy, (2) DEc, University 'G. d'Annunzio', Chieti-Pescara, Italy, (3) DICII, University of Rome 'Tor Vergata', Italy, (4) Imperial, London, UK) View a PDF of the paper titled Constrained Assumption-Based Argumentation Frameworks, by Emanuele De Angelis (1) and 17 other authors View PDF HTML (experimental) Abstract:Assumption-based Argumentation (ABA) is a well-established form of structured argumentation. ABA frameworks with an underlying atomic language are widely studied, but their applicability is limited by a representational restriction to ground (variable-free) arguments and attacks built from propositional atoms. In this paper, we lift this restriction and propose a novel notion of constrained ABA (CABA), whose components, as well as arguments built from them, may include constrained variables, ranging over possibly infinite domains. We define non-ground semantics for CABA, in terms of various notions of non-ground attacks. We show that the new semantics conservatively generalise standard ABA semantics. Comments: Subjects: Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO) Cite as: arXiv:2602.13135 [cs.AI] (or arXiv:2602.13135v1 [cs.AI] ...