论文标题
自动聚合器 - 重写计数聚合
Automated Aggregator -- Rewriting with the Counting Aggregate
论文作者
论文摘要
答案集编程是领先的声明性约束编程范式，可广泛用于复杂的知识密集型应用程序。现代答案集编程语言支持许多同等方法来建模程序中的约束和规格。但是，到目前为止，答案集编程未能开发出系统的方法来构建表示形式，这些方法将非常适合自动处理。这表明以与算法选择和求解算法相同的方式编码选择可能是改善答案求解求解性能的可行方向。必要的先决条件是自动化生成可能的替代编码的过程。在这里，我们提出了一个自动重写系统，即自动化的聚合器或AAGG，该系统给定了一个非地面逻辑程序，在现代答案集编程求解器下运行时，会产生一个具有互补性能的等效程序家族。我们通过实验分析证明了这种行为，并提出了系统在自动答案集编程求解器选择工具中的使用。
Answer set programming is a leading declarative constraint programming paradigm with wide use for complex knowledge-intensive applications. Modern answer set programming languages support many equivalent ways to model constraints and specifications in a program. However, so far answer set programming has failed to develop systematic methodologies for building representations that would uniformly lend well to automated processing. This suggests that encoding selection, in the same way as algorithm selection and portfolio solving, may be a viable direction for improving performance of answer-set solving. The necessary precondition is automating the process of generating possible alternative encodings. Here we present an automated rewriting system, the Automated Aggregator or AAgg, that given a non-ground logic program, produces a family of equivalent programs with complementary performance when run under modern answer set programming solvers. We demonstrate this behavior through experimental analysis and propose the system's use in automated answer set programming solver selection tools.
