Vicious Circle Principle and Logic Programs with Aggregates

Abstract

The paper presents a knowledge representation language $\mathcal{A}log$ 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 $\mathcal{A}log$, an algorithm for computing its answer sets, and comparison with other approaches.

Cited by in corpus (10)

• ASP-Core-2 Input Language Format
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• Complexity and Compilation of GZ-Aggregates in Answer Set Programming
• ASP(AC): Answer Set Programming with Algebraic Constraints
• Recursive Rules with Aggregation: A Simple Unified Semantics
• Enhancing magic sets with an application to ontological reasoning
• Relating Two Dialects of Answer Set Programming
• LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories
• Hybrid Answer Set Programming: Foundations and Applications
• Quantitative and Stream Extensions of Answer Set Programming