On Computing Explanations in Argumentation

AAAI 2015 pp. 1496-1502

doi:10.1609/AAAI.V29I1.9420 /aaai/2015/fan2015aaai-computing/

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.

PDF AAAI Semantic Scholar

Cite

Text

Fan and Toni. "On Computing Explanations in Argumentation." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9420

Markdown

[Fan and Toni. "On Computing Explanations in Argumentation." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/fan2015aaai-computing/) doi:10.1609/AAAI.V29I1.9420

BibTeX

@inproceedings{fan2015aaai-computing,
  title     = {{On Computing Explanations in Argumentation}},
  author    = {Fan, Xiuyi and Toni, Francesca},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {1496-1502},
  doi       = {10.1609/AAAI.V29I1.9420},
  url       = {https://mlanthology.org/aaai/2015/fan2015aaai-computing/}
}