Answer Set Programming with Quantifiers ASP(Q) is a recent extension of Answer Set Programming (ASP) that allows one to model problems from the entire polynomial hierarchy. Earlier work focused on demonstrating modeling capabilities of ASP(Q). In this paper, we propose a modular ASP(Q) solver that translates a quantified ASP program together with a given data instance into a Quantified Boolean Formula (QBF) to be solved by any QBF solver. We evaluate the performance of our solver on several instances and with different back-end QBF solvers, demonstrating the efficacy of ASP(Q) as a tool for rapid modeling and solving of complex combinatorial problems. The benchmark problems we use include two new ones, Argumentation Coherence and Para-coherent ASP, for which we develop elegant ASP(Q) encodings.
|Title of host publication||Logic Programming and Nonmonotonic Reasoning - 16th International Conference, LPNMR 2022, Proceedings|
|Editors||Georg Gottlob, Daniela Inclezan, Marco Maratea|
|Number of pages||14|
|State||Published - 2022|
|Event||16th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2022 - Genoa, Italy|
Duration: Sep 5 2022 → Sep 9 2022
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||16th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2022|
|Period||9/5/22 → 9/9/22|
Bibliographical notePublisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
- Answer Set Programming
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)