@article{Cerutti_Tachmazidis_Vallati_Batsakis_Giacomin_Antoniou_2015, title={Exploiting Parallelism for Hard Problems in Abstract Argumentation}, volume={29}, url={https://ojs.aaai.org/index.php/AAAI/article/view/9395}, DOI={10.1609/aaai.v29i1.9395}, abstractNote={ <p> Abstract argumentation framework (<em>AF</em>) 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 <em>AF</em>s 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. </p> }, number={1}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Cerutti, Federico and Tachmazidis, Ilias and Vallati, Mauro and Batsakis, Sotirios and Giacomin, Massimiliano and Antoniou, Grigoris}, year={2015}, month={Feb.} }