Axiomatization of Aggregates in Answer Set Programming
DOI:
https://doi.org/10.1609/aaai.v36i5.20504Keywords:
Knowledge Representation And Reasoning (KRR)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.Downloads
Published
2022-06-28
How to Cite
Fandinno, J., Hansen, Z., & Lierler, Y. (2022). Axiomatization of Aggregates in Answer Set Programming. Proceedings of the AAAI Conference on Artificial Intelligence, 36(5), 5634-5641. https://doi.org/10.1609/aaai.v36i5.20504
Issue
Section
AAAI Technical Track on Knowledge Representation and Reasoning