Cerutti, Federico, Vallati, Mauro and Giacomin, Massimiliano (2017) On the Impact of Configuration on Abstract Argumentation Automated Reasoning. International Journal of Approximate Reasoning, 92. pp. 120-138. ISSN 0888-613X

In this paper we consider the impact of configuration of abstract argumentation reasoners both when using a single solver and choosing combinations of framework representation–solver options; and also when composing portfolios of algorithms.

To exemplify the impact of the framework–solver configuration we consider one of the most configurable solvers, namely ArgSemSAT—runner-up of the last competition on computational models of argumentation (ICCMA-15)—for enumerating preferred extensions. We discuss how to configure the representation of the argumentation framework in the input file and show how this coupled framework–solver configuration can have a remarkable impact on performance.

As to the impact of configuring differently structured portfolios of abstract argumentation solvers, we consider the solvers submitted to ICCMA-15, which provided the community with a heterogeneous panorama of approaches for handling abstract argumentation frameworks. A superficial reading of the results of ICCMA-15 is that reduction-based systems (either SAT-based or ASP-based) are always the most efficient. Our investigation, concerning the enumeration of stable and preferred extensions, shows that this 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.

impactconfigurationportfolio-ijar.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (525kB) | Preview


Downloads per month over past year

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email