AMO-aware Aggregates in Answer Set Programming

Mario Alviano; Carmine Dodaro; Salvatore Fiorentino; Marco Maratea

IJCAI 2024poster0 citations

AMO-aware Aggregates in Answer Set Programming

Mario Alviano, Carmine Dodaro, Salvatore Fiorentino, Marco Maratea

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.

Knowledge Representation and Reasoning: KRR: Logic programmingKnowledge Representation and Reasoning: KRR: Non-monotonic reasoning

BibTeX

@inproceedings{ijcai2024p356,
  title     = {AMO-aware Aggregates in Answer Set Programming},
  author    = {Alviano, Mario and Dodaro, Carmine and Fiorentino, Salvatore and Maratea, Marco},
  booktitle = {Proceedings of the Thirty-Third International Joint Conference on
               Artificial Intelligence, {IJCAI-24}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},
  editor    = {Kate Larson},
  pages     = {3215--3223},
  year      = {2024},
  month     = {8},
  note      = {Main Track},
  doi       = {10.24963/ijcai.2024/356},
  url       = {https://doi.org/10.24963/ijcai.2024/356},
}