On Computing Explanations in Argumentation
Proceedings of the AAAI Conference on Artificial Intelligence2015Vol. 29(1)
Citations Over TimeTop 10% of 2015 papers
Abstract
Argumentation can be viewed as a process of generating explanations. However, existing argumentation semantics are developed for identifying acceptable arguments within a set, rather than giving concrete justifications for them. In this work, we propose a new argumentation semantics, related admissibility, designed for giving explanations to arguments in both Abstract Argumentation and Assumption-based Argumentation. We identify different types of explanations defined in terms of the new semantics. We also give a correct computational counterpart for explanations using dispute forests.
Related Papers
- → Refined Preference-based Argumentation Frameworks(2010)13 cited
- → Towards a Unified Model of Preference-Based Argumentation(2010)16 cited
- → Computing Argument Preferences and Explanations in Abstract Argumentation(2018)2 cited
- → An Introduction and Comparison of Dung's Argumentation Frameworks(2009)1 cited