Operator-based semantics for choice programs: is choosing losing? (full version)
Not on the map. Why?
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.
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
7 of 34 references.
References · 7
- 2019ASP-Core-2 Input Language Formatcited by 77
- 2021Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theorycited by 6
- 2021On the Foundations of Grounding in Answer Set Programmingcited by 6
- 2021Aggregate Semantics for Propositional Answer Set Programscited by 5
- 2022Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programmingcited by 5
- 2018Vicious Circle Principle and Logic Programs with Aggregatescited by 4
- 2023Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)cited by 3
Built on by
Not cited yet.