Answer set programming is a declarative logic programming paradigm geared towards solving difficult combinatorial search problems. While different logic programs can encode the same problem, their performance may vary significantly. It is not always easy to identify which version of the program performs the best. We present the system Predictor (and its algorithmic backend) for estimating the grounding size of programs, a metric that can influence a performance of a system processing a program. We evaluate the impact of Predictor when used as a guide for rewritings produced by the answer set programming rewriting tools Projector and Lpopt. The results demonstrate potential to this approach.
翻译:----
翻译后的摘要:
答案集编程是一种面向解决困难组合搜索问题的声明式逻辑编程范式。虽然不同的逻辑程序可以编码相同的问题,但它们的性能可能会有很大差别。很难确定哪个版本的程序表现最佳。我们提出了系统预测器(以及其算法后端),用于估算程序的接地大小,这是一个可能会影响处理程序的系统性能的度量标准。当作为答案集编程重写工具Projector和Lpopt生成的重写的指南时,我们评估了预测器的影响。结果证明了这种方法的潜力。