Abstract
We develop a notion of explanations for acceptance of arguments in an abstract argumentation framework.
To this end we show that extensions returned by Dung's standard semantics can be decomposed into
i) non-deterministic choices made on even cycles of the given argumentation graph and then
ii) deterministic iteration of the so-called characteristic function.
Naturally, the choice made in i) can be viewed as an explanation for the corresponding extension and thus the arguments it contains.
We proceed to propose desirable criteria a reasonable notion of an explanation should satisfy.
We present an exhaustive study of the newly introduced notion w.r.t. these criteria.
Finally some interesting decision problems arise from our analysis and we examine their computational complexity, obtaining some surprising tractability results.
Publisher
International Joint Conferences on Artificial Intelligence Organization
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. CBR Driven Interactive Explainable AI;Case-Based Reasoning Research and Development;2023
2. Revisiting initial sets in abstract argumentation;Argument & Computation;2022-10-18
3. Computing Smallest MUSes of Quantified Boolean Formulas;Logic Programming and Nonmonotonic Reasoning;2022