Exploiting Parallelism for Hard Problems in Abstract Argumentation


  • Federico Cerutti University of Aberdeen
  • Ilias Tachmazidis University of Huddersfield
  • Mauro Vallati University of Huddersfield
  • Sotirios Batsakis University of Huddersfield
  • Massimiliano Giacomin University of Brescia
  • Grigoris Antoniou University of Huddersfield




Abstract argumentation framework (AF) is a unifying framework able to encompass a variety of nonmonotonic reasoning approaches, logic programming and computational argumentation. Yet, efficient approaches for most of the decision and enumeration problems associated to AFs are missing, thus limiting the efficacy of argumentation-based approaches in real domains. In this paper, we present an algorithm for enumerating the preferred extensions of abstract argumentation frameworks which exploits parallel computation. To this purpose, the SCC-recursive semantics definition schema is adopted, where extensions are defined at the level of specific sub-frameworks. The algorithm shows significant performance improvements in large frameworks, in terms of number of solutions found and speedup.




How to Cite

Cerutti, F., Tachmazidis, I., Vallati, M., Batsakis, S., Giacomin, M., & Antoniou, G. (2015). Exploiting Parallelism for Hard Problems in Abstract Argumentation. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9395



AAAI Technical Track: Knowledge Representation and Reasoning