Extracting Policies from Quantified Answer Set Programs
Open Access
- 8 January 2026
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 439, 224-237
Abstract
Quantified Answer Set Programming (QASP) extends Answer Set Programming (ASP) by allowing quantification over propositional variables, similar to Quantified Boolean Formulas (QBF). In this paper, we interpret models of QASP formulas in terms of policies, which represent decision-making strategies that determine how existentially quantified variables should be assigned, given the conditions set by universally quantified variables. As a main contribution, we present an algorithm for policy extraction under QASP semantics, inspired by the Equilibrium Logic semantics for general ASP theories.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Solving Problems in the Polynomial Hierarchy with ASP(Q)2022
- Planning with Incomplete Information in Quantified Answer Set ProgrammingTheory and Practice of Logic Programming, 2021
- Beyond NP: Quantifying over Answer SetsTheory and Practice of Logic Programming, 2019
- Stable-unstable semantics: Beyond NP with normal logic programsTheory and Practice of Logic Programming, 2016
- Thirteen Definitions of a Stable Model2010
- A Unified Framework for Certificate and Compilation for QBF2008
- Equilibrium logicAnnals of Mathematics and Artificial Intelligence, 2006
- sKizzo: A Suite to Evaluate and Certify QBFs2005
- Quantified Propositional Gödel Logics2002
- Encodings for Equilibrium Logic and Logic Programs with Nested ExpressionsLecture Notes in Computer Science, 2001