arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1106.0671cs.AI
收藏

域过滤一致性

Domain Filtering Consistencies

Ecole des Mines de Nantes(南特矿业学院);LIRMM(蒙彼利埃计算机科学与机器人实验室)

C. Bessiere, R. Debruyne

摘要:

约束推理的主要特征之一是增强局部约束。在约束网络中搜索解时,应该使用哪一级的局部一致性是一个基本问题。弧一致性和弧一致性的部分形式已经被广泛研究,并且通过前向检查或MAC搜索算法已经知道了一段时间。直到最近,更强形式的局部一致性仍然局限于那些改变约束图结构的形式,因此无法在实践中使用,特别是在大型网络上。本文重点研究了在不改变网络结构的情况下,强于弧一致性的局部一致性,即,只从域中删除不一致的值。在过去五年中,我们或其他人提出了几个这样的地方政府。我们对它们进行了概述,并强调了它们之间的一些关系。我们比较他们的理论和实验,考虑到他们的修剪效率和执行它们所需的时间。

英文摘要:

Enforcing local consistencies is one of the main features of constraint reasoning. Which level of local consistency should be used when searching for solutions in a constraint network is a basic question. Arc consistency and partial forms of arc consistency have been widely studied, and have been known for sometime through the forward checking or the MAC search algorithms. Until recently, stronger forms of local consistency remained limited to those that change the structure of the constraint graph, and thus, could not be used in practice, especially on large networks. This paper focuses on the local consistencies that are stronger than arc consistency, without changing the structure of the network, i.e., only removing inconsistent values from the domains. In the last five years, several such local consistencies have been proposed by us or by others. We make an overview of all of them, and highlight some relations between them. We compare them both theoretically and experimentally, considering their pruning efficiency and the time required to enforce them.

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

↑