arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.2287cs.LO
收藏

ASP模CSP:clingcon系统

ASP modulo CSP: The clingcon system

Max Ostrowski, Torsten Schaub

摘要:

我们提出了混合ASP求解器clingcon,结合简单的建模语言和高性能的布尔求解能力的答案集编程(ASP)的技术,使用非布尔约束的约束编程(CP)的区域。新的clingcon系统具有扩展的语法,支持全局约束和约束变量的优化语句。主要的技术创新,提高了ASP和CP求解器之间的互动,通过详细的学习技术的基础上不可约的不一致集。一个广泛的实证评估表明,这些技术产生一个数量级的性能改善。逻辑程序设计理论与实践Theory and Practice of Logic Programming

英文摘要:

We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude. To appear in Theory and Practice of Logic Programming

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑