Constrained Assumption-Based Argumentation Frameworks
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908959249530880 |
|---|---|
| author | De Angelis, Emanuele Fioravanti, Fabio Meo, Maria Chiara Pettorossi, Alberto Proietti, Maurizio Toni, Francesca |
| author_facet | De Angelis, Emanuele Fioravanti, Fabio Meo, Maria Chiara Pettorossi, Alberto Proietti, Maurizio Toni, Francesca |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_13135 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Constrained Assumption-Based Argumentation Frameworks De Angelis, Emanuele Fioravanti, Fabio Meo, Maria Chiara Pettorossi, Alberto Proietti, Maurizio Toni, Francesca Artificial Intelligence Logic in Computer Science 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. |
| title | Constrained Assumption-Based Argumentation Frameworks |
| topic | Artificial Intelligence Logic in Computer Science |
| url | https://arxiv.org/abs/2602.13135 |