Axiomatization of Aggregates in Answer Set Programming

Jorge Fandinno, Zachary Hansen, Yuliya Lierler

AAAI 2022 pp. 5634-5641

doi:10.1609/AAAI.V36I5.20504 /aaai/2022/fandinno2022aaai-axiomatization/

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.

PDF AAAI Semantic Scholar

Cite

Text

Fandinno et al. "Axiomatization of Aggregates in Answer Set Programming." AAAI Conference on Artificial Intelligence, 2022. doi:10.1609/AAAI.V36I5.20504

Markdown

[Fandinno et al. "Axiomatization of Aggregates in Answer Set Programming." AAAI Conference on Artificial Intelligence, 2022.](https://mlanthology.org/aaai/2022/fandinno2022aaai-axiomatization/) doi:10.1609/AAAI.V36I5.20504

BibTeX

@inproceedings{fandinno2022aaai-axiomatization,
  title     = {{Axiomatization of Aggregates in Answer Set Programming}},
  author    = {Fandinno, Jorge and Hansen, Zachary and Lierler, Yuliya},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2022},
  pages     = {5634-5641},
  doi       = {10.1609/AAAI.V36I5.20504},
  url       = {https://mlanthology.org/aaai/2022/fandinno2022aaai-axiomatization/}
}