下一篇：Clingcon：The Next Generation
Clingcon: The Next Generation
摘要：
我们提出了第三代的约束答案集系统clingcon，结合答案集编程（ASP）和有限域约束处理（CP）。虽然它的前辈依靠黑盒方法通过集成CP求解器gecode来混合求解，但新的clingcon系统采用了一种懒惰的方法，使用专用的约束传播器来扩展底层ASP求解器clasp中的传播。不需要对clingcon的混合建模语言进行解析和基础扩展，因为ASP grounder gringo的新通用理论处理能力可以容纳这两种语言。作为一个整体，clingcon 3是ASP系统clingo 5的扩展，clingo 5本身依赖于grounder gringo和solver clasp。clingcon的新方法提供了CP传播到ASP求解的无缝集成，这得益于卡环推理模式的整个频谱，包括例如多镜头求解和高级优化技术。这是通过一种惰性方法来实现的，该方法展开约束的表示，并仅在需要时将其添加到逻辑程序的表示中。虽然展开通常由求解过程中的约束传播器决定，但它可以在预处理过程中部分（甚至全部）完成。此外，clingcon的约束预处理和传播结合了几种成熟的CP技术，大大提高了其性能。我们证明了这一点，通过一个广泛的实证评估对比，第一，CSP解决方案的背景下，第二，新的clingcon系统与其他混合ASP系统的各种技术。逻辑程序设计理论与实践（Theory and Practice of Logic Programming，TPLP）
英文摘要：
We present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp. No extension is needed for parsing and grounding clingcon's hybrid modeling language since both can be accommodated by the new generic theory handling capabilities of the ASP grounder gringo. As a whole, clingcon 3 is thus an extension of the ASP system clingo 5, which itself relies on the grounder gringo and the solver clasp. The new approach of clingcon offers a seamless integration of CP propagation into ASP solving that benefits from the whole spectrum of clasp's reasoning modes, including for instance multi-shot solving and advanced optimization techniques. This is accomplished by a lazy approach that unfolds the representation of constraints and adds it to that of the logic program only when needed. Although the unfolding is usually dictated by the constraint propagators during solving, it can already be partially (or even totally) done during preprocessing. Moreover, clingcon's constraint preprocessing and propagation incorporate several well established CP techniques that greatly improve its performance. We demonstrate this via an extensive empirical evaluation contrasting, first, the various techniques in the context of CSP solving and, second, the new clingcon system with other hybrid ASP systems. Under consideration in Theory and Practice of Logic Programming (TPLP)
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
