Exploiting parallelism for hard problems in abstract argumentation

Cerutti, Federico ORCID: https://orcid.org/0000-0003-0755-0358, Tachmazidis, Ilias, Vallati, Mauro, Batsakis, Sotirios, Giacomin, Massimiliano and Antoniou, Grigoris 2015. Exploiting parallelism for hard problems in abstract argumentation. Presented at: Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-15), Austin, TX, USA, 25-30 Jan 2015.

Preview

PDF - Submitted Pre-Print Version Download (272kB) | Preview

Abstract

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 AF 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.

Item Type:	Conference or Workshop Item (Paper)
Status:	Unpublished
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Last Modified:	01 Nov 2022 09:53
URI:	https://orca.cardiff.ac.uk/id/eprint/89572

Citation Data

Cited 7 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item