ASP求解中的约束、惰性约束或简化器：一项实证分析
Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis
摘要：
答案集编程（ASP）是一个成熟的声明性范例。ASP的成功之一是有效的系统的可用性。最先进的系统基于地面+求解方法。在某些应用中，这种方法是不可行的，因为一个或几个约束的基础是昂贵的。在本文中，我们系统地比较替代策略，以避免有问题的约束的实例化，这是基于自定义扩展的求解器。真实和合成基准的结果突出了不同策略的一些优点和缺点。（正在考虑接受TPLP，ICLP 2017年特刊。
英文摘要：
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 few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, that are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies. (Under consideration for acceptance in TPLP, ICLP 2017 Special Issue.)
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
