On the robustness of argumentative explanations
File(s)FAIA-388-FAIA240323.pdf (262.74 KB)
Published version
Author(s)
Rapberger, Anna
Toni, Francesca
Type
Conference Paper
Abstract
The field of explainable AI has grown exponentially in recent years.
Within this landscape, argumentation frameworks have shown to be helpful ab-
stractions of some AI models towards providing explanations thereof. While exist-
ing work on argumentative explanations and their properties has focused on static
settings, we focus on dynamic settings whereby the (AI models underpinning the)
argumentation frameworks need to change. Specifically, for a number of notions
of explanations drawn from abstract argumentation frameworks under extension-
based semantics, we address the following questions: (1) Are explanations robust to
extension-preserving changes, in the sense that they are still valid when the changes
do not modify the extensions? (2) If not, are these explanations pseudo-robust in
that can be tractably updated? In this paper, we frame these questions formally. We
consider robustness and pseudo-robustness w.r.t. ordinary and strong equivalence
and provide several results for various extension-based semantics.
Within this landscape, argumentation frameworks have shown to be helpful ab-
stractions of some AI models towards providing explanations thereof. While exist-
ing work on argumentative explanations and their properties has focused on static
settings, we focus on dynamic settings whereby the (AI models underpinning the)
argumentation frameworks need to change. Specifically, for a number of notions
of explanations drawn from abstract argumentation frameworks under extension-
based semantics, we address the following questions: (1) Are explanations robust to
extension-preserving changes, in the sense that they are still valid when the changes
do not modify the extensions? (2) If not, are these explanations pseudo-robust in
that can be tractably updated? In this paper, we frame these questions formally. We
consider robustness and pseudo-robustness w.r.t. ordinary and strong equivalence
and provide several results for various extension-based semantics.
Date Issued
2024-09-18
Date Acceptance
2024-06-10
Citation
Computational Models of Argument Proceedings of COMMA 2024, 2024, 388, pp.217-228
ISBN
978-1-64368-534-2
Publisher
IOS Press, Inc.
Start Page
217
End Page
228
Journal / Book Title
Computational Models of Argument Proceedings of COMMA 2024
Volume
388
Copyright Statement
© 2024 The Authors.
This article is published online with Open Access by IOS Press and distributed under the terms
of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0)
This article is published online with Open Access by IOS Press and distributed under the terms
of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0)
Identifier
https://ebooks.iospress.nl/doi/10.3233/FAIA240323
Source
10th International Conference on Computational Models of Argument (COMMA 2024)
Publication Status
Published
Start Date
2024-09-18
Finish Date
2024-09-20
Coverage Spatial
Hagen, Germany
Date Publish Online
2024-09-18