Cerutti, Federico, Vallati, Mauro and Giacomin, Massimiliano (2016) Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems. In: Proceedings of The 6th International Conference on Computational Models of Argument. IOS Press. (In Press)
- Accepted Version
Restricted to Repository staff only
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 suggesting that reduction-based systems (either SAT-based or ASP-based) are the most efficient.
Our investigation shows that we show 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:||Book Chapter|
|Subjects:||Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
|Schools:||School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
School of Computing and Engineering
|Depositing User:||Mauro Vallati|
|Date Deposited:||20 Jun 2016 16:01|
|Last Modified:||01 Dec 2016 10:28|
Downloads per month over past year
Repository Staff Only: item control page