# Constrained Assumption-Based Argumentation Frameworks

arXiv: https://arxiv.org/abs/2602.13135 · HTML: https://mlsanity.com/paper/2602.13135/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 36 references that are in the map.
- First posted on arXiv 13 Feb 2026.

## Builds on (most cited first, 3 of 3)

- [Constraint Answer Set Programming without Grounding](https://mlsanity.com/paper/1804.11162/) (2018)
- [Argumentative Causal Discovery](https://mlsanity.com/paper/2405.11250/) (2024)
- [Learning Brave Assumption-Based Argumentation Frameworks via ASP](https://mlsanity.com/paper/2408.10126/) (2024)

## Abstract (arXiv)

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.