In this section
@inproceedings{kampik:2025,
author = {kampik, T and Yin, X and Potyka, N and Toni, F},
publisher = {nternational Foundation for Autonomous Agents and Multiagent Systems},
title = {Strength change explanations in quantitative argumentation},
year = {2025}
}
TY - CPAPER
AB - 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 soundnessand completeness properties of our strength change explanations, and demonstrate their existence and non-existence in some special cases. 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, althoughlimitations remain for the general problem.
AU - kampik,T
AU - Yin,X
AU - Potyka,N
AU - Toni,F
PB - nternational Foundation for Autonomous Agents and Multiagent Systems
PY - 2025///
TI - Strength change explanations in quantitative argumentation
ER -
Artificial Intelligence Network
South Kensington Campus
Imperial College London
SW7 2AZ
To reach the elected speaker of the network, Dr Rossella Arcucci, please contact:
To reach the network manager, Diana O'Malley - including to join the network - please contact: