Author:
Fandinno Jorge,Hansen Zachary,Lierler Yuliya
Abstract
The paper presents a characterization of logic programs with aggregates based on many-sorted generalization of operator SM that refers neither to grounding nor to fixpoints. This characterization introduces new symbols for aggregate operations and aggregate elements, whose meaning is fixed by adding appropriate axioms to the result of the SM transformation. We prove that for programs without positive recursion through aggregates our semantics coincides with the semantics of the answer set solver Clingo.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Locally Tight Programs;Theory and Practice of Logic Programming;2024-01-19
2. External Behavior of a Logic Program and Verification of Refactoring;Theory and Practice of Logic Programming;2023-07
3. Tools and Methodologies for Verifying Answer Set Programs;Electronic Proceedings in Theoretical Computer Science;2022-08-04
4. Strong Equivalence of Logic Programs with Counting;Theory and Practice of Logic Programming;2022-06-24
5. Semantics for Conditional Literals via the SM Operator;Logic Programming and Nonmonotonic Reasoning;2022