Vicious Circle Principle and Logic Programs with Aggregates
Michael Gelfond, Yuanlin Zhang

TL;DR
This paper introduces $log$, a logic programming language extending ASP with aggregates, emphasizing simplicity, clear semantics, and providing an answer set computation algorithm and comparisons.
Contribution
It presents a new knowledge representation language with aggregates, offering simple syntax, intuitive semantics, and an answer set computation method.
Findings
Properties of $log$ are established
An algorithm for computing answer sets is provided
Comparison with other approaches is included
Abstract
The paper presents a knowledge representation language 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 , an algorithm for computing its answer sets, and comparison with other approaches.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
