State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional programs. The size of this grounding depends heavily on the size of the non-ground rules, and thus, reducing the size of such rules is a promising approach to improve solving performance. To this end, in this paper we announce lpopt, a tool that decomposes large logic programming rules into smaller rules that are easier to handle for current solvers. The tool is specifically tailored to handle the standard syntax of the ASP language (ASP-Core) and makes it easier for users to write efficient and intuitive ASP programs, which would otherwise often require significant handtuning by expert ASP engineers. It is based on an idea proposed by Morak and Woltran (2012) that we extend significantly in order to handle the full ASP syntax, including complex constructs like aggregates, weak constraints, and arithmetic expressions. We present the algorithm, the theoretical foundations on how to treat these constructs, as well as an experimental evaluation showing the viability of our approach.

中文翻译：

---

lpopt：用于答案集编程的规则优化工具

最新的答案集编程（ASP）求解程序依靠称为基础程序的程序将包含变量的非基础程序转换为无变量的命题程序。此接地的大小在很大程度上取决于非接地规则的大小，因此，减小此类规则的大小是一种提高求解性能的有前途的方法。为此，在本文中，我们宣布了lpopt，该工具可将大型逻辑编程规则分解为较小的规则，这些规则对于当前的求解程序而言更易于处理。该工具专门为处理ASP语言（ASP-Core）的标准语法而量身定制，使用户可以更轻松地编写高效且直观的ASP程序，否则，这通常需要专业的ASP工程师进行大量的手动调整。它基于Morak和Woltran（2012）提出的思想，我们进行了显着扩展以处理完整的ASP语法，包括诸如聚合，弱约束和算术表达式之类的复杂结构。我们介绍了算法，如何处理这些构造的理论基础，以及表明了我们方法可行性的实验评估。