Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems

Federico Cerutti, Mauro Vallati, Massimiliano Giacomin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationComputational Models of Argument
Subtitle of host publicationProceedings of COMMA 2016
Place of PublicationNetherlands
PublisherIOS Press
Number of pages12
ISBN (Electronic)9781614996866
ISBN (Print)9781614996859
Publication statusPublished - 2016
Event6th International Conference on Computational Models of Argument - University of Potsdam, Potsdam, Germany
Duration: 12 Sep 201616 Sep 2016
Conference number: 6
http://www.ling.uni-potsdam.de/comma2016/ (Link to Conference Website)

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314


Conference6th International Conference on Computational Models of Argument
Abbreviated titleCOMMA 2016
Internet address

Cite this