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

一种求解约束答案集的平移方法

A Translational Approach to Constraint Answer Set Solving

Christian Drescher, Toby Walsh

摘要:

我们提出了一种新的方法来增强回答集编程(ASP)与约束处理技术,它允许解决有趣的约束满足问题,在ASP。我们展示了如何限制有限域可以分解成逻辑程序,使单位传播实现弧,界或范围的一致性。我们的编码实验证明了它们的计算影响。

英文摘要:

We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.

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

↑