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 contribution

9 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationComputational Models of Argument
Subtitle of host publicationProceedings of COMMA 2016
Place of PublicationNetherlands
PublisherIOS Press
Pages207-218
Number of pages12
Volume287
ISBN (Electronic)9781614996866
ISBN (Print)9781614996859
DOIs
Publication statusPublished - 2016
Event6th International Conference on Computational Models of Argument - University of Potsdam, Potsdam, Germany
Duration: 13 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
Volume287
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314

Conference

Conference6th International Conference on Computational Models of Argument
Abbreviated titleCOMMA 2016
CountryGermany
CityPotsdam
Period13/09/1616/09/16
Internet address

Cite this

Cerutti, F., Vallati, M., & Giacomin, M. (2016). Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems. In Computational Models of Argument: Proceedings of COMMA 2016 (Vol. 287, pp. 207-218). (Frontiers in Artificial Intelligence and Applications; Vol. 287). Netherlands: IOS Press. https://doi.org/10.3233/978-1-61499-686-6-207
Cerutti, Federico ; Vallati, Mauro ; Giacomin, Massimiliano. / Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems. Computational Models of Argument: Proceedings of COMMA 2016. Vol. 287 Netherlands : IOS Press, 2016. pp. 207-218 (Frontiers in Artificial Intelligence and Applications).
@inproceedings{cf018a914ce94e8c8108fb9cdc7ff79e,
title = "Where Are We Now?: State of the Art and Future Trends of Solvers for Hard Argumentation Problems",
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.",
keywords = "Solvers for Argumentation Problems, Portfolios methods for Argumentation, abstract argumentation",
author = "Federico Cerutti and Mauro Vallati and Massimiliano Giacomin",
year = "2016",
doi = "10.3233/978-1-61499-686-6-207",
language = "English",
isbn = "9781614996859",
volume = "287",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
pages = "207--218",
booktitle = "Computational Models of Argument",
address = "Netherlands",

}

Cerutti, F, Vallati, M & Giacomin, M 2016, Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems. in Computational Models of Argument: Proceedings of COMMA 2016. vol. 287, Frontiers in Artificial Intelligence and Applications, vol. 287, IOS Press, Netherlands, pp. 207-218, 6th International Conference on Computational Models of Argument, Potsdam, Germany, 13/09/16. https://doi.org/10.3233/978-1-61499-686-6-207

Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems. / Cerutti, Federico; Vallati, Mauro; Giacomin, Massimiliano.

Computational Models of Argument: Proceedings of COMMA 2016. Vol. 287 Netherlands : IOS Press, 2016. p. 207-218 (Frontiers in Artificial Intelligence and Applications; Vol. 287).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Where Are We Now?

T2 - State of the Art and Future Trends of Solvers for Hard Argumentation Problems

AU - Cerutti, Federico

AU - Vallati, Mauro

AU - Giacomin, Massimiliano

PY - 2016

Y1 - 2016

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

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

KW - Solvers for Argumentation Problems

KW - Portfolios methods for Argumentation

KW - abstract argumentation

U2 - 10.3233/978-1-61499-686-6-207

DO - 10.3233/978-1-61499-686-6-207

M3 - Conference contribution

SN - 9781614996859

VL - 287

T3 - Frontiers in Artificial Intelligence and Applications

SP - 207

EP - 218

BT - Computational Models of Argument

PB - IOS Press

CY - Netherlands

ER -

Cerutti F, Vallati M, Giacomin M. Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems. In Computational Models of Argument: Proceedings of COMMA 2016. Vol. 287. Netherlands: IOS Press. 2016. p. 207-218. (Frontiers in Artificial Intelligence and Applications). https://doi.org/10.3233/978-1-61499-686-6-207