Extracting Policies from Quantified Answer Set Programs
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.
Fields of Study & Subjects
Logic
Reasoning
and Knowledge
Multi-Agent Systems and Negotiation
Semantic Web and Ontologies
Publication details
- Journal / source
- Electronic Proceedings in Theoretical Computer Science
- Volume
- 439
- Pages
- 224–237
- Publication date
- 8 January 2026
- Language
- EN