Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence

This paper shows that the semantics of programs with aggregates implemented by the solvers clingo and dlv can be characterized as extended First-Order formulas with intensional functions in the logic of Here-and-There. Furthermore, this characterization can be used to study the strong equivalence of programs with aggregates under either semantics. We also present a transformation that reduces the task of checking strong equivalence to reasoning in classical First-Order logic, which serves as a foundation for automating this procedure.
Comment: Accepted for publication in the Proceedings of the 39th Annual AAAI Conference on Artificial Intelligence