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.
Empowering ASPQ to win in QBFEval 2018
Cuteri B.;Dodaro C.;Ricca F.
2019-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
