Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis*
Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis*
复制标题
ASP 求解中的约束、惰性约束或传播器：实证分析*
DOI：
--
复制
发表时间：
2017
影响因子：
1.4
通讯作者：
P. Schüller
中科院分区：
文献类型：
--
作者：
Bernardo Cuteri;Carmine Dodaro;F. Ricca;P. Schüller
答案集编程（ASP）是一种公认的声明式编程范式。ASP的成功之处在于提供了高效的系统。最先进的系统是基于地面+解决方法。在某些应用中，这种方法是不可行的，因为一个或几个约束的接地是昂贵的。在本文中，我们系统地比较了不同的策略，以避免问题约束的实例化，这是基于求解器的自定义扩展。真实基准和合成基准的结果突出了不同战略的一些优点和缺点。
Abstract Answer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, which are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies.