约束回答集求解器EZCSP和集成模式的重要性
Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter
摘要：
答案集编程和约束编程的研究人员在混合语言和求解算法的开发上花费了大量的精力，结合了这些传统上独立领域的优势。这些努力导致了一个新的研究领域：约束答案集编程。约束答案集程序设计语言和系统被证明是成功的，在提供声明，但有效的解决方案，涉及混合推理任务的问题。本文的主要贡献之一是第一次全面考虑的约束答案集语言和求解器EZCSP，这一研究领域的主流代表，已被用于各种成功的应用程序。我们还开发了Nieuwenhuis等人在2006年提出的过渡系统的扩展。捕获布尔可满足性求解器。我们使用这个扩展来描述EZCSP算法，并证明它的正式声明。EZCSP背后的设计和算法细节清楚地表明，这种混合系统的发展是具有挑战性的。当一个人面临各种设计选择时，许多问题出现在试图最大化系统的好处。混合求解器的开发人员所做的关键决策之一是在其实现中确定特定的集成模式。因此，本文的另一个重要贡献是基于EZCSP的深入案例研究，重点是它提供的各种集成模式。逻辑程序设计理论与实践（TPLP）
英文摘要：
Researchers in answer set programming and constraint programming have spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. These efforts resulted in a new research area: constraint answer set programming. Constraint answer set programming languages and systems proved to be successful at providing declarative, yet efficient solutions to problems involving hybrid reasoning tasks. One of the main contributions of this paper is the first comprehensive account of the constraint answer set language and solver EZCSP, a mainstream representative of this research area that has been used in various successful applications. We also develop an extension of the transition systems proposed by Nieuwenhuis et al. in 2006 to capture Boolean satisfiability solvers. We use this extension to describe the EZCSP algorithm and prove formal claims about it. The design and algorithmic details behind EZCSP clearly demonstrate that the development of the hybrid systems of this kind is challenging. Many questions arise when one faces various design choices in an attempt to maximize system's benefits. One of the key decisions that a developer of a hybrid solver makes is settling on a particular integration schema within its implementation. Thus, another important contribution of this paper is a thorough case study based on EZCSP, focused on the various integration schemas that it provides. Under consideration in Theory and Practice of Logic Programming (TPLP).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
