# Operator-based semantics for choice programs: is choosing losing? (full version)

arXiv: https://arxiv.org/abs/2407.21556 · HTML: https://mlsanity.com/paper/2407.21556/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 7 of its 34 references that are in the map.
- First posted on arXiv 31 Jul 2024.

## Builds on (most cited first, 7 of 7)

- [ASP-Core-2 Input Language Format](https://mlsanity.com/paper/1911.04326/) (2019)
- [Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory](https://mlsanity.com/paper/2104.14789/) (2021)
- [On the Foundations of Grounding in Answer Set Programming](https://mlsanity.com/paper/2108.04769/) (2021)
- [Aggregate Semantics for Propositional Answer Set Programs](https://mlsanity.com/paper/2109.08662/) (2021)
- [Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming](https://mlsanity.com/paper/2211.17262/) (2022)
- [Vicious Circle Principle and Logic Programs with Aggregates](https://mlsanity.com/paper/1808.07050/) (2018)
- [Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)](https://mlsanity.com/paper/2305.10846/) (2023)

## Abstract (arXiv)

Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics have not been compared in a principled way. In this paper, an operator-based framework allow for the definition and comparison of different semantics in a principled way is proposed.