Automated algorithm selection techniques have been applied successfully to Answer Set Programming (ASP) solvers. ASP computation includes two levels of computation: variable substitution, called grounding, and propositional answer set search, called solving. In this paper we present me-aspML, an extended ASP system applying algorithm selection techniques to both levels of computation in order to choose the most promising solving strategy. Experiments conducted on benchmarks and solvers of the Fifth ASP Competition shows that me-aspML is able to solve more instances than state-of-the-art systems.
Multi-level algorithm selection for ASP / Maratea, Marco; Pulina, Luca; Ricca, Francesco. - 9345:(2015), pp. 439-445. (Intervento presentato al convegno 13th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2015 tenutosi a usa nel 2015) [10.1007/978-3-319-23264-5_36].
Multi-level algorithm selection for ASP
PULINA, Luca;
2015-01-01
Abstract
Automated algorithm selection techniques have been applied successfully to Answer Set Programming (ASP) solvers. ASP computation includes two levels of computation: variable substitution, called grounding, and propositional answer set search, called solving. In this paper we present me-aspML, an extended ASP system applying algorithm selection techniques to both levels of computation in order to choose the most promising solving strategy. Experiments conducted on benchmarks and solvers of the Fifth ASP Competition shows that me-aspML is able to solve more instances than state-of-the-art systems.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
