# Strength Change Explanations in Quantitative Argumentation

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 6 of its 29 references that are in the map.
- First posted on arXiv 26 Jan 2026.

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

- [Argumentative XAI: A Survey](https://mlsanity.com/paper/2105.11266/) (2021)
- [Interpreting Neural Networks as Gradual Argumentation Frameworks (Including Proof Appendix)](https://mlsanity.com/paper/2012.05738/) (2020)
- [Modular Semantics and Characteristics for Bipolar Weighted Argumentation Graphs](https://mlsanity.com/paper/1807.06685/) (2018)
- [Impact Measures for Gradual Argumentation Semantics](https://mlsanity.com/paper/2407.08302/) (2024)
- [Change in Quantitative Bipolar Argumentation: Sufficient, Necessary, and Counterfactual Explanations](https://mlsanity.com/paper/2509.18215/) (2025)
- [Visualizing Extensions of Argumentation Frameworks as Layered Graphs](https://mlsanity.com/paper/2409.05457/) (2024)

## Built on by (most cited first, 2 of 2)

- [Contrastive Explanations in Quantitative Bipolar Argumentation Frameworks](https://mlsanity.com/paper/2609.02399/) (2026)
- [Self-Evolving Multimedia Verification through Memory Consolidation of Contestation Experiences](https://mlsanity.com/paper/2609.27175/) (2026)

## Abstract (arXiv)

In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative (bipolar) argumentation graphs. Strength change explanations describe changes to the initial strengths of a subset of the arguments in a given graph that can achieve a desired ordering based on the final strengths of some (potentially different) subset of arguments. We show that the existing notions of inverse and counterfactual problems can be reduced to strength change explanations. We also prove basic soundness and completeness properties of our strength change explanations, and demonstrate their existence and non-existence in some special cases. By applying a heuristic search, we demonstrate that we can often successfully find strength change explanations for layered graphs that are common in typical application scenarios; still, limitations remain for settings where we do not provide guarantees for the presence (or absence) of explanations.