We investigate the computational problem of determining the set of acceptable arguments in abstract argumentation wrt. credulous and skeptical reasoning under grounded, complete, stable, and preferred semantics. In particular, we investigate the computational complexity of that problem and its verification variant, and develop four SAT-based algorithms for the case of credulous reasoning under stable semantics, two baseline approaches based on iterative acceptability queries and extension enumeration and two optimised algorithms.
|Title of host publication||Proceedings of the 8th International Conference on Models of Argument|
|Subtitle of host publication||(COMMA 2020)|
|Publication status||Accepted/In press - 19 Jun 2020|
|Event||8th International Conference on Computational Models of Argument - Online due to COVID-19|
Duration: 8 Sep 2020 → 11 Sep 2020
Conference number: 8
|Conference||8th International Conference on Computational Models of Argument|
|Abbreviated title||COMMA 2020|
|Period||8/09/20 → 11/09/20|
Thimm, M., Cerutti, F., & Vallati, M. (Accepted/In press). On Computing the Set of Acceptable Arguments in Abstract Argumentation. In Proceedings of the 8th International Conference on Models of Argument : (COMMA 2020) IOS Press.