Vicious Circle Principle and Logic Programs with Aggregates
Not on the map. Why?
Abstract (arXiv)
The paper presents a knowledge representation language Alog which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some properties of Alog, an algorithm for computing its answer sets, and comparison with other approaches.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 2.
4 papers.
- 2022Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programmingcited by 5
- 2024Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalencecited by 1
- 2021Quantitative and Stream Extensions of Answer Set Programmingcited by 0
- 2024Operator-based semantics for choice programs: is choosing losing? (full version)cited by 0
- 2024Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence14 Dec 2024
- 2024Operator-based semantics for choice programs: is choosing losing? (full version)31 Jul 2024
- 2022Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming30 Nov 2022
- 2021Quantitative and Stream Extensions of Answer Set Programming17 Sep 2021