ASPQ: An ASP-Based 2QBF Solver

Giovanni Amendola, Carmine Dodaro, Francesco Ricca

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

Abstract / Description of output

Answer Set Programming (ASP) is an established logic-based programming paradigm which has been successfully applied for solving complex problems. Since ASP can model problems up to the second level of the polynomial hierarchy, it can be used to model and solve the 2QBF problem. In this paper we show how to obtain a fairly effective 2QBF solver by just resorting to state-of-the-art ASP solvers.
Original languageEnglish
Title of host publicationProceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016)
PublisherCEUR Workshop Proceedings (CEUR-WS.org)
Pages49-54
Number of pages6
Publication statusPublished - 4 Jul 2016
Event4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing - Bordeaux, France
Duration: 4 Jul 20164 Jul 2016
http://ceur-ws.org/Vol-1719/

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR-WS.org
Volume1719
ISSN (Electronic)1613-0073

Conference

Conference4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing
Abbreviated titleQBF 2016
Country/TerritoryFrance
CityBordeaux
Period4/07/164/07/16
Internet address

Fingerprint

Dive into the research topics of 'ASPQ: An ASP-Based 2QBF Solver'. Together they form a unique fingerprint.

Cite this