AAAI 2025technical0 citations
Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence
Jorge Fandinno, Zachary Hansen
Abstract
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.
BibTeX
@article{Fandinno_Hansen_2025, title={Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence}, volume={39}, url={https://ojs.aaai.org/index.php/AAAI/article/view/33633}, DOI={10.1609/aaai.v39i14.33633}, abstractNote={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.}, number={14}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Fandinno, Jorge and Hansen, Zachary}, year={2025}, month={Apr.}, pages={14893-14901} }