Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Strength change explanations in quantitative argumentation

Kampik, Timotheus, Yin, Xiang, Potyka, Nico and Toni, Francesca 2026. Strength change explanations in quantitative argumentation. Presented at: The 25th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2026), Paphos, Cyprus, 25–29 May 2026. Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2026). International Foundation for Autonomous Agents and Multiagent Systems,

[thumbnail of Inverse_Problems___Strength_Changes__AAMAS.pdf]
Preview
PDF - Accepted Post-Print Version
Available under License Creative Commons Attribution.

Download (691kB) | Preview

Abstract

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.

Item Type: Conference or Workshop Item - published (Paper)
Status: In Press
Schools: Schools > Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Related URLs:
Date of First Compliant Deposit: 28 January 2026
Date of Acceptance: 19 December 2025
Last Modified: 28 Jan 2026 11:15
URI: https://orca.cardiff.ac.uk/id/eprint/184214

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics