Answer Set Programming (ASP) is a well-known problem-solving formalism in computational logic. Nowadays, ASP is used in many real world scenarios thanks to ASP solvers. Standard evaluation of ASP programs suffers from an intrinsic limitation, knows as Grounding Bottleneck, due to the grounding of some rules that could fit all the available memory. As a result, there exist instances of real world problems that are untractable using the standard Ground and Solve approach. In order to tackle this problem, different strategies have been proposed. Among them we focus on a recent approach based on compilation of problematic constraints as propagators, which revealed to be very promising but is currently limited to constraints without aggregates. Since aggregates are widely used in ASP, in this paper we extend such an approach also to constraints containing aggregates. Good results, that proof the effectiveness of the proposed approach, have been reached.

中文翻译：

---

ASP中聚合的编译

答案集编程 (ASP) 是计算逻辑中众所周知的问题解决形式。如今，由于 ASP 求解器，ASP 被用于许多现实世界的场景中。ASP 程序的标准评估有一个内在的限制，称为接地瓶颈，这是由于某些规则的基础可以适合所有可用内存。因此，存在使用标准 Ground and Solve 方法无法解决的现实世界问题实例。为了解决这个问题，已经提出了不同的策略。其中，我们专注于最近的一种基于将有问题的约束编译为传播器的方法，该方法显示非常有前途，但目前仅限于没有聚合的约束。由于聚合在 ASP 中被广泛使用，在本文中，我们还将这种方法扩展到包含聚合的约束。已经取得了证明所提议方法的有效性的良好结果。