Affiliation:
1. Artificial Intelligence Group, University of Hagen, Germany
Abstract
We revisit the notion of initial sets by Xu and Cayrol (In Proceedings of the 1st Chinese Conference on Logic and Argumentation (CLAR’16) 2016), i. e., non-empty minimal admissible sets in abstract argumentation frameworks. Initial sets are a simple concept for analysing conflicts in an abstract argumentation framework and to explain why certain arguments can be accepted. We contribute with new insights on the structure of initial sets and devise a simple non-deterministic construction principle for any admissible set, based on iterative selection of initial sets of the original framework and its induced reducts. In particular, we characterise many existing admissibility-based semantics via this construction principle, thus providing a constructive explanation on the structure of extensions. We also investigate certain problems related to initial sets with respect to their computational complexity.
Subject
Artificial Intelligence,Computational Mathematics,Computer Science Applications,Linguistics and Language
Reference40 articles.
1. L. Amgoud and J. Ben-Naim, Ranking-based semantics for argumentation frameworks, in: Proceedings of the 7th International Conference on Scalable Uncertainty Management (SUM 2013), W. Liu, V.S. Subrahmanian and J. Wijsen, eds, Lecture Notes in Artificial Intelligence, Vol. 8078, Washington, DC, USA, 2013.
2. Using arguments for making and explaining decisions;Amgoud;Artificial Intelligence,2009
3. Toward artificial argumentation;Atkinson;AI Magazine,2017
4. On the input/output behavior of argumentation frameworks;Baroni;Artificial Intelligence,2014
5. P. Baroni, M. Caminada and M. Giacomin, Abstract argumentation frameworks and their semantics, in: Handbook of Formal Argumentation, P. Baroni, D. Gabbay, M. Giacomin and L. van der Torre, eds, College Publications, 2018, pp. 159–236.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献