Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.18198 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908762041745408 |
|---|---|
| author | Aguado, Felicidad Cabalar, Pedro Muñiz, Brais Pérez, Gilberto Vidal, Concepción |
| author_facet | Aguado, Felicidad Cabalar, Pedro Muñiz, Brais Pérez, Gilberto Vidal, Concepción |
| contents | In this paper, we compare four different semantics for disjunction in Answer Set Programming that, unlike stable models, do not adhere to the principle of model minimality. Two of these approaches, Cabalar and Muñiz' \emph{Justified Models} and Doherty and Szalas' \emph{Strongly Supported Models}, directly provide an alternative non-minimal semantics for disjunction. The other two, Aguado et al's \emph{Forks} and Shen and Eiter's \emph{Determining Inference} (DI) semantics, actually introduce a new disjunction connective, but are compared here as if they constituted new semantics for the standard disjunction operator. We are able to prove that three of these approaches (Forks, Justified Models and a reasonable relaxation of the DI semantics) actually coincide, constituting a common single approach under different definitions. Moreover, this common semantics always provides a superset of the stable models of a program (in fact, modulo any context) and is strictly stronger than the fourth approach (Strongly Supported Models), that actually treats disjunctions as in classical logic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_18198 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Comparing Non-minimal Semantics for Disjunction in Answer Set Programming Aguado, Felicidad Cabalar, Pedro Muñiz, Brais Pérez, Gilberto Vidal, Concepción Artificial Intelligence In this paper, we compare four different semantics for disjunction in Answer Set Programming that, unlike stable models, do not adhere to the principle of model minimality. Two of these approaches, Cabalar and Muñiz' \emph{Justified Models} and Doherty and Szalas' \emph{Strongly Supported Models}, directly provide an alternative non-minimal semantics for disjunction. The other two, Aguado et al's \emph{Forks} and Shen and Eiter's \emph{Determining Inference} (DI) semantics, actually introduce a new disjunction connective, but are compared here as if they constituted new semantics for the standard disjunction operator. We are able to prove that three of these approaches (Forks, Justified Models and a reasonable relaxation of the DI semantics) actually coincide, constituting a common single approach under different definitions. Moreover, this common semantics always provides a superset of the stable models of a program (in fact, modulo any context) and is strictly stronger than the fourth approach (Strongly Supported Models), that actually treats disjunctions as in classical logic. |
| title | Comparing Non-minimal Semantics for Disjunction in Answer Set Programming |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2507.18198 |