Constrained Assumption-Based Argumentation Frameworks
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
TL;DR
This paper introduces constrained ABA (CABA), extending traditional assumption-based argumentation to include variables over infinite domains, with new semantics that generalize existing ABA frameworks.
Contribution
It proposes a novel non-ground semantics for CABA, allowing arguments with variables and generalizing standard ABA semantics.
Findings
CABA extends ABA to include variables over infinite domains.
New semantics for CABA generalize standard ABA semantics.
Framework supports more expressive argumentation structures.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.