# Vicious Circle Principle and Logic Programs with Aggregates

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

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Aug 2018.

## Built on by (most cited first, 4 of 4)

- [Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming](https://mlsanity.com/paper/2211.17262/) (2022)
- [Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence](https://mlsanity.com/paper/2412.10975/) (2024)
- [Quantitative and Stream Extensions of Answer Set Programming](https://mlsanity.com/paper/2109.08281/) (2021)
- [Operator-based semantics for choice programs: is choosing losing? (full version)](https://mlsanity.com/paper/2407.21556/) (2024)

## 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.