Proceedings

AMO-aware Aggregates in Answer Set Programming

Download BibTeX Cite

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. Main Track. Pages 3215-3223.

https://doi.org/10.24963/ijcai.2024/356

Abstract

Aggregates such as sum and count are among the most frequently used linguistic extensions of Answer Set Programming (ASP).

At-most-one (AMO) constraints are a specific form of aggregates that excludes the simultaneous truth of multiple elements in a set.

This article unleashes a powerful propagation strategy in case groups of elements in an aggregate are also involved in AMO constraints.

In fact, the combined knowledge given by aggregates and AMO constraints significantly increases the effectiveness of search space pruning, resulting in sensible performance gains.

Mario Alviano, Carmine Dodaro, Salvatore Fiorentino, and Marco Maratea. 2024. AMO-aware Aggregates in Answer Set Programming. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24. IJCAI, 3215–3223. https://doi.org/10.24963/ijcai.2024/356
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards