Extracting Policies from Quantified Answer Set Programs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909983430410240 |
|---|---|
| author | Diéguez, Martín Stéphan, Igor |
| author_facet | Diéguez, Martín Stéphan, Igor |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_03835 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Extracting Policies from Quantified Answer Set Programs Diéguez, Martín Stéphan, Igor Logic in Computer Science F.4.1 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. |
| title | Extracting Policies from Quantified Answer Set Programs |
| topic | Logic in Computer Science F.4.1 |
| url | https://arxiv.org/abs/2601.03835 |