Strong Equivalence in Answer Set Programming with Constraints
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912222559600640 |
|---|---|
| author | Cabalar, Pedro Fandinno, Jorge Schaub, Torsten Wanko, Philipp |
| author_facet | Cabalar, Pedro Fandinno, Jorge Schaub, Torsten Wanko, Philipp |
| contents | We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if, informally speaking, they have the same meaning in any context. We demonstrate that, under certain assumptions, strong equivalence between rule sets in this extended setting can be precisely characterized by their equivalence in the logic of Here-and-There with constraints. Furthermore, we present a translation from the language of several clingo-based answer set solvers that handle constraints into the language of Here-and-There with constraints. This translation enables us to leverage the logic of Here-and-There to reason about strong equivalence within the context of these solvers. We also explore the computational complexity of determining strong equivalence in this context. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_04302 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Strong Equivalence in Answer Set Programming with Constraints Cabalar, Pedro Fandinno, Jorge Schaub, Torsten Wanko, Philipp Artificial Intelligence Logic in Computer Science I.2.4; I.2.8 We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if, informally speaking, they have the same meaning in any context. We demonstrate that, under certain assumptions, strong equivalence between rule sets in this extended setting can be precisely characterized by their equivalence in the logic of Here-and-There with constraints. Furthermore, we present a translation from the language of several clingo-based answer set solvers that handle constraints into the language of Here-and-There with constraints. This translation enables us to leverage the logic of Here-and-There to reason about strong equivalence within the context of these solvers. We also explore the computational complexity of determining strong equivalence in this context. |
| title | Strong Equivalence in Answer Set Programming with Constraints |
| topic | Artificial Intelligence Logic in Computer Science I.2.4; I.2.8 |
| url | https://arxiv.org/abs/2502.04302 |