Where are we now? State of the art and future trends of solvers for hard argumentation problems

Cerutti, Federico ORCID: https://orcid.org/0000-0003-0755-0358, Vallati, Mauro and Giacomin, Massimiliano 2016. Where are we now? State of the art and future trends of solvers for hard argumentation problems. Presented at: The 6th International Conference on Computational Models of Argument, Potsdam, Germany, 12-16 September 2016.

Preview

PDF - Accepted Post-Print Version Download (187kB) | Preview

Abstract

We evaluate the state of the art of solvers for hard argumentation problems—the enumeration of preferred and stable extensions—to envisage future trends based on evidence collected as part of an extensive empirical evaluation. In the last international competition on computational models of argumentation a general impression was that reduction-based systems (either SAT-based or ASP-based) are the most efficient. Our investigation shows that this impression is not true in full generality and suggests the areas where the relatively under-developed non reduction-based systems should focus more to improve their performance. Moreover, it also highlights that the state-of-the-art solvers are very complementary and can be successfully combined in portfolios: our best per-instance portfolio is 51% (resp. 53%) faster than the best single solver for enumerating preferred (resp. stable) extensions.

Item Type:	Conference or Workshop Item (Paper)
Status:	Unpublished
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date of First Compliant Deposit:	12 July 2016
Last Modified:	01 Nov 2022 10:40
URI:	https://orca.cardiff.ac.uk/id/eprint/92465

Citation Data

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

Actions (repository staff only)

Edit Item