Beyond NP: Quantifying over Answer Sets

Abstract

Answer Set Programming (ASP) is a logic programming paradigm featuring a purely declarative language with comparatively high modeling capabilities. Indeed, ASP can model problems in NP in a compact and elegant way. However, modeling problems beyond NP with ASP is known to be complicated, on the one hand, and limited to problems in Σ P 2 on the other. Inspired by the way Quantified Boolean Formulas extend SAT formulas to model problems beyond NP, we propose an extension of ASP that introduces quantifiers over stable models of programs. We name the new language ASP with Quantifiers (ASP(Q)). In the paper we identify computational properties of ASP(Q); we highlight its modeling capabilities by reporting natural encodings of several complex problems with applications in artificial intelligence and number theory; and we compare ASP(Q) with related languages. Arguably, ASP(Q) allows one to model problems in the Polynomial Hierarchy in a direct way, providing an elegant expansion of ASP beyond the class NP. Under consideration for acceptance in TPLP.1 For example, weak constraints allow to model decision problems that are ∆ P 3 -complete (Buccafurri et al. 2000). 1 = ∃ st , P 1 = P, and C = / 0. Then, AS(P) = QAS(Π).

Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers

“…Answer Set Programming with Quantifiers (ASP(Q)). An extension of ASP, referred to as ASP(Q), has been proposed (Amendola, Ricca, and Truszczynski 2019), providing a formalism reminiscent of Quantified Boolean Formulas, but based on ASP. An ASP(Q) program is of the form…”

Advanced tools and methods for treewidth-based problem solving

“…Studying these formalisms then lead to applicability in the context of knowledge representation and reasoning, as well as artificial intelligence in general (see, e.g., [Egly et al, 2000;Truszczyński, 2007]), which resulted in further generalizations and extensions [Eiter et al, 2007;Truszczyński, 2010;Aziz et al, 2015;Shen and Eiter, 2017;Amendola et al, 2019;Cabalar et al, 2020].…”

Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity

“…For instance, deciding whether a formula is an MUS is D P -complete. However, the complexity of problems involving ICs in the setting of ASP is primarily unexplored, despite plenty of investigations on ASP problems of higher complexity (Bogaerts, Janhunen, and Tasharrofi 2016;Amendola, Ricca, and Truszczynski 2019) and considerations on strong inconsistency in ASP (Mencía and Marques-Silva 2020).…”