pith. sign in

arxiv: 2602.13135 · v2 · submitted 2026-02-13 · 💻 cs.AI · cs.LO

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
show 8 more authors
(2) DEc University 'G. d'Annunzio' Chieti-Pescara (3) DICII University of Rome 'Tor Vergata' (4) Imperial London UK)
This is my paper

Pith reviewed 2026-05-15 22:17 UTC · model grok-4.3

classification 💻 cs.AI cs.LO
keywords assumption-based argumentationconstrained argumentationnon-ground semanticsargumentation frameworksstructured argumentation
0
0 comments X

The pith

Constrained ABA frameworks let arguments contain variables and constraints while their semantics reduce exactly to standard ABA on ground cases.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Standard assumption-based argumentation is restricted to ground, variable-free arguments and attacks. This paper removes that restriction by defining constrained ABA frameworks in which arguments and their components may contain variables ranging over possibly infinite domains. It introduces several notions of non-ground attacks between such constrained arguments and defines corresponding semantics. The central result is that these semantics conservatively generalise the usual ABA semantics: every standard ground instance is recovered exactly when the constraints are instantiated.

Core claim

Constrained ABA frameworks are defined by allowing atomic sentences, assumptions, and rules to contain variables subject to constraints. Non-ground attacks are then defined directly on these open arguments so that acceptability notions (such as admissible or stable extensions) can be stated without first grounding everything. The paper proves that the resulting non-ground semantics coincide with ordinary ABA semantics on every ground instantiation.

What carries the argument

Non-ground attacks between constrained arguments, which relate open structures and are required to preserve the attack relation under every admissible variable instantiation.

If this is right

  • Any existing ground ABA framework is recovered unchanged by setting all constraints to true and all variables to ground terms.
  • Reasoning over infinite domains becomes possible without enumerating instances in advance.
  • Proofs and algorithms developed for standard ABA can be reused once the appropriate grounding step is inserted.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Constraint solvers could be coupled directly to the attack relation to prune unacceptable branches early.
  • The same lifting technique might apply to other structured argumentation systems that currently require grounding.

Load-bearing premise

Non-ground attacks between constrained arguments must behave exactly like ordinary attacks once every variable is replaced by a concrete ground term.

What would settle it

A concrete constrained argument pair and a non-ground attack such that at least one ground instantiation produces an acceptable set of assumptions different from the one predicted by the non-ground semantics.

read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The paper introduces Constrained Assumption-Based Argumentation (CABA) as an extension of standard ABA, permitting constrained variables in arguments and attacks that range over possibly infinite domains. It defines non-ground semantics via several notions of non-ground attacks and claims that these semantics conservatively generalize the standard ground ABA semantics, reducing exactly to them upon variable instantiation.

Significance. If the conservative generalization holds rigorously, the work would meaningfully extend ABA's representational power to non-ground and parametric settings without introducing fitted parameters or altering core properties, which is a clear strength for applications in knowledge representation involving variables or constraints.

major comments (1)
  1. [§3 (non-ground attack definitions)] Definition of non-ground attacks (likely in §3): the claim of conservative generalization requires that every ground instantiation of a CABA attack relation coincides exactly with the standard ABA attack relation on the corresponding ground framework. The skeptic concern is valid here—if the definition relies on partial unification or existential quantification over domains without enforcing that all satisfying substitutions produce attacks, spurious attacks may appear or valid ground attacks may be missed, especially over infinite domains; this is load-bearing for the central claim and must be shown explicitly with a formal recovery theorem.
minor comments (2)
  1. Add a concrete example showing the exact reduction to standard ABA when all variables are instantiated to ground terms.
  2. Clarify notation for constrained variables versus standard logical variables to avoid confusion with existing ABA literature.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on our manuscript introducing Constrained Assumption-Based Argumentation (CABA). We address the major comment on the non-ground attack definitions and the need for an explicit formal recovery theorem below.

read point-by-point responses

  1. Referee: Definition of non-ground attacks (likely in §3): the claim of conservative generalization requires that every ground instantiation of a CABA attack relation coincides exactly with the standard ABA attack relation on the corresponding ground framework. The skeptic concern is valid here—if the definition relies on partial unification or existential quantification over domains without enforcing that all satisfying substitutions produce attacks, spurious attacks may appear or valid ground attacks may be missed, especially over infinite domains; this is load-bearing for the central claim and must be shown explicitly with a formal recovery theorem.

    Authors: We agree that an explicit formal recovery theorem would strengthen the rigor of our central claim. In Section 3, non-ground attacks are defined via constrained substitutions: an attack holds between two (possibly non-ground) arguments if there exists a substitution satisfying all constraints that unifies the relevant literals in a manner consistent with standard ABA attack conditions. This uses full constraint satisfaction rather than partial unification, ensuring completeness over (possibly infinite) domains. In the revised manuscript we will add a dedicated Recovery Theorem (new subsection in §3) stating and proving that, for any CABA framework F and any ground instantiation F' obtained by applying a satisfying substitution, the induced attack relation on F' coincides exactly with the standard ABA attack relation on F'. The proof proceeds by showing both directions: (i) every ground attack in F' arises from some satisfying substitution in the CABA attack relation, and (ii) no spurious attacks are generated because only substitutions satisfying the full constraint set are admitted. This directly addresses the concern for infinite domains by relying on the semantics of constraint satisfaction rather than existential quantification alone. revision: yes

Circularity Check

0 steps flagged

No circularity detected in the conservative generalization claim

full rationale

The paper introduces CABA by extending ABA components to include constrained variables over possibly infinite domains, defines non-ground attacks and semantics for these, and then shows that the new semantics reduce exactly to standard ABA semantics when all variables are instantiated to ground terms. This is a standard definitional extension and conservative generalization technique with no fitted parameters, no self-referential equations, and no load-bearing self-citations that would force the result. The reduction is established by explicit instantiation rather than by construction or renaming, making the derivation self-contained against the external benchmark of ground ABA.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

Based on abstract only: relies on standard ABA as background; introduces constrained variables as new concept without independent evidence provided in abstract.

axioms (1)
  • domain assumption Standard ABA frameworks and their ground semantics
    The paper builds directly on existing ABA literature as the base case for conservative generalization.
invented entities (1)
  • Constrained variables in arguments and attacks no independent evidence
    purpose: To enable non-ground representations over infinite domains
    New representational device introduced to lift the ground-atom restriction of standard ABA.

pith-pipeline@v0.9.0 · 5476 in / 1027 out tokens · 49100 ms · 2026-05-15T22:17:54.301664+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages

  1. [1]

    Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, and Paolo Torroni. 2008. Verifiable agent interaction in abductive logic program- ming: The SCIFF framework.ACM Trans. Comput. Logic9, 4, Article 29 (Aug. 2008), 43 pages. doi:10.1145/1380572.1380578

    work page doi:10.1145/1380572.1380578 2008

  2. [2]

    Krzysztof R. Apt. 1990. Introduction to Logic Programming. InHandbook of Theoretical Computer Science, J. van Leeuwen (Ed.). Elsevier, 493–576

    work page 1990

  3. [3]

    Joaquín Arias, Manuel Carro, Elmer Salazar, Kyle Marple, and Gopal Gupta. 2018. Constraint Answer Set Programming without Grounding.Theory and Practice of Logic Programming18, 3–4 (2018), 337–354. doi:10.1017/S1471068418000285

    work page doi:10.1017/s1471068418000285 2018

  4. [4]

    Joaquín Arias, Gopal Gupta, and Manuel Carro. 2021. A Short Tutorial on s(CASP), a Goal-directed Execution of Constraint Answer Set Programs. InICLP Workshops (CEUR Workshop Proceedings, Vol. 2970). CEUR-WS.org. https://ceur-ws.org/Vol- 2970/gdepaper1.pdf

    work page 2021

  5. [5]

    Kowalski, and Francesca Toni

    Andrei Bondarenko, Phan Minh Dung, Robert A. Kowalski, and Francesca Toni

    work page

  6. [6]

    An Abstract, Argumentation-Theoretic Approach to Default Reasoning. Artif. Intell.93 (1997), 63–101. doi:10.1016/S0004-3702(97)00015-5

    work page doi:10.1016/s0004-3702(97)00015-5 1997

  7. [7]

    Pedro Cabalar, Roland Kaminski, Max Ostrowski, and Torsten Schaub. 2016. An ASP Semantics for Default Reasoning with Constraints. InProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, S. Kambhampati (Ed.). IJCAI/AAAI Press, 1015–1021. http://www.ijcai.org/Abstract/16/148

    work page 2016

  8. [8]

    Keith L. Clark. 1977. Negation as Failure. InLogic and Data Bases, Symposium on Logic and Data Bases, 1977 (Advances in Data Base Theory), H. Gallaire and J. Minker (Eds.). Plenum Press, New York, 293–322. doi:10.1007/978-1-4684-3384- 5_11

    work page doi:10.1007/978-1-4684-3384- 1977

  9. [9]

    Kristijonas Cyras, Xiuyi Fan, Claudia Schulz, and Francesca Toni. 2017. Assumption-based Argumentation: Disputes, Explanations, Preferences.FLAP4, 8 (2017). http://www.collegepublications.co.uk/downloads/ifcolog00017.pdf

    work page 2017

  10. [10]

    Kristijonas Čyras, Tiago Oliveira, Amin Karamlou, and Francesca Toni. 2021. Assumption-based argumentation with preferences and goals for patient-centric reasoning with interacting clinical guidelines.Argument Comput.12, 2 (2021), 149–189. doi:10.3233/AAC-200523

    work page doi:10.3233/aac-200523 2021

  11. [11]

    Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti, and Francesca Toni. 2026. Constrained Assumption-Based Argumentation Frameworks. InAAMAS 2026 - 25th International Conference on Autonomous Agents and Multiagent Systems, Paphos, Cyprus, C. Amato, L. Den- nis, V. Mascardi, and J. Thangarajah (Eds.). IFAAMAS, 9 ...

    work page 2026

  12. [12]

    Emanuele De Angelis, Maurizio Proietti, and Francesca Toni. 2024. Learning Brave Assumption-Based Argumentation Frameworks via ASP. InECAI 2024 - 27th European Conference on Artificial Intelligence (Frontiers in Artificial Intelligence and Applications, Vol. 392), U. Endriss, F. S. Melo, K. Bach, A. J. Bugarín Diz, J. M. Alonso-Moral, S. Barro, and F. Hei...

    work page 2024

  13. [13]

    Phan Minh Dung. 1995. On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games. Artif. Intell.77, 2 (1995), 321–358. doi:10.1016/0004-3702(94)00041-X

    work page doi:10.1016/0004-3702(94)00041-x 1995

  14. [14]

    Kowalski, and Francesca Toni

    Phan Minh Dung, Robert A. Kowalski, and Francesca Toni. 2009. Assumption- Based Argumentation. InArg. in AI. Springer, 199–218

    work page 2009

  15. [15]

    Phan Minh Dung and Phan Minh Thang. 2010. Towards (Probabilistic) Argumen- tation for Jury-based Dispute Resolution. InCOMMA. 171–182. doi:10.3233/978- 1-60750-619-5-171

    work page doi:10.3233/978- 2010

  16. [16]

    Xiuyi Fan. 2018. A Temporal Planning Example with Assumption-Based Argu- mentation. InPRIMA 2018: Principles and Practice of Multi-Agent Systems. 362–370. doi:10.1007/978-3-030-03098-8_22

    work page doi:10.1007/978-3-030-03098-8_22 2018

  17. [17]

    TheASPIC + framework for structured argumentation: a tutorial.Argument and Computation, 5(1):31–62, 2014

    Alejandro J. García and Guillermo R. Simari. 2014. Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers.Arg. & Comp5, 1 (2014), 63–88. doi:10.1080/19462166.2013.869767

    work page doi:10.1080/19462166.2013.869767 2014

  18. [18]

    Joxan Jaffar and Jean Louis Lassez. 1987. Constraint Logic Programming. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, Germany, 1987. ACM Press, 111–119. doi:10. 1145/41625.41635

    work page arXiv 1987

  19. [19]

    Joxan Jaffar and Michael Maher. 1994. Constraint Logic Programming: A Survey. Journal of Logic Programming19/20 (1994), 503–581. doi:10.1016/0743-1066(94) 90033-7

    work page doi:10.1016/0743-1066(94 1994

  20. [20]

    Kenneth Kunen. 1987. Negation in Logic Programming.Journal of Logic Pro- gramming4, 4 (1987), 289–308. doi:10.1016/0743-1066(87)90007-0

    work page doi:10.1016/0743-1066(87)90007-0 1987

  21. [21]

    John W. Lloyd. 1987.Foundations of Logic Programming. Springer-Verlag, Berlin. Second Edition

    work page 1987

  22. [22]

    Fabrizio Macagno, Douglas Walton, and Chris Reed. 2017. Argumentation Schemes. History, Classifications, and Computational Applications.FLAP4, 8 (2017). http://www.collegepublications.co.uk/downloads/ifcolog00017.pdf

    work page 2017

  23. [23]

    Paolo Mancarella, Giacomo Terreni, Fariba Sadri, Francesca Toni, and Ulle Endriss

    work page

  24. [24]

    The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments.Theory Pract. Log. Program.9, 6 (2009), 691–750. doi:10.1017/S1471068409990093

    work page doi:10.1017/s1471068409990093 2009

  25. [25]

    1997.Introduction to Mathematical Logic

    Elliott Mendelson. 1997.Introduction to Mathematical Logic. Chapman&Hall. 4th Edition

    work page 1997

  26. [26]

    Fabrizio Russo, Anna Rapberger, and Francesca Toni. 2024. Argumentative Causal Discovery. InKR. 938–949. doi:10.24963/KR.2024/88

    work page doi:10.24963/kr.2024/88 2024

  27. [27]

    Kenneth Skiba, Matthias Thimm, and Johannes Peter Wallner. 2024. Ranking Transition-Based Medical Recommendations Using Assumption-Based Argumen- tation. InRATIO. 202–220. doi:10.1007/978-3-031-63536-6_12

    work page doi:10.1007/978-3-031-63536-6_12 2024

  28. [28]

    Peter Stuckey. 1991. Constructive Negation for Constraint Logic Programming. InProceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS ’91), Amsterdam, The Netherlands. IEEE Computer Society, 328–339. doi:10.1109/ LICS.1991.151657

    work page arXiv 1991

  29. [29]

    Peter Stuckey. 1995. Negation and Constraint Logic Programming.Inf. Comput. 118, 1 (1995), 12–33. doi:10.1006/INCO.1995.1048

    work page doi:10.1006/inco.1995.1048 1995

  30. [30]

    Francesca Toni. 2014. A tutorial on Assumption-based Argumentation.Arg. & Comp5, 1 (2014), 89–117

    work page 2014

  31. [31]

    2008.Argumentation Schemes

    Douglas Walton, Chris Reed, and Fabrizio Macagno. 2008.Argumentation Schemes. Cambridge University Press. http://www.cambridge.org/us/academic/subjects/ philosophy/logic/argumentation-schemes

    work page 2008

  32. [32]

    Zhiwei Zeng, Zhiqi Shen, Jing Jih Chin, Cyril Leung, Yu Wang, Ying Chi, and Chunyan Miao. 2020. Explainable and Contextual Preferences based Decision Making with Assumption-based Argumentation for Diagnostics and Prognostics of Alzheimer’s Disease. InAAMAS. 2071–2073. doi:10.5555/3398761.3399078 APPENDIX A CABA FORMALIZATION OF THE INTRODUCTORY EXAMPLE In...

    work page doi:10.5555/3398761.3399078 2020