Answer Set Programming (ASP) is an established logic-based programming paradigm which has been successfully applied for solving complex problems since it features efficient implementations. In previous work we showed how to obtain ASPQ, a fairly effective 2QBF solver, by just resorting to state of the art ASP solvers. In this work we describe how we have optimized it to exploit some unexpressed potential of its solving strategy. The resulting empowered solver won the Hard Instances Track in the 2018 QBFEval.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Empowering ASPQ to win in QBFEval 2018|
|Data di pubblicazione:||2019|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|