arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.03796cs.CCcs.AIcs.DM
收藏

基于禁止模式的二元约束满足中变量和值的消除

Variable and value elimination in binary constraint satisfaction via forbidden patterns

Royal Holloway, University of London(伦敦大学皇家霍洛威学院);IRIT, University of Toulouse III(图卢兹第三大学图卢兹计算机研究所);Insight Centre for Data Analytics(洞察数据分析中心);University College Cork(科克大学学院);University of Oxford(牛津大学)

David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivny

摘要:

约束满足问题(CSP)中的变量或值消除可用于预处理或搜索期间以减小搜索空间大小。变量消除规则(值消除规则)允许多项式时间识别某些变量(域元素),其消除不引入额外的补偿约束,不影响实例的可满足性。我们发现,基本上只有四个变量消除规则和三个值消除规则定义的禁止通用子实例,被称为不可约的存在模式,在弧一致的CSP实例。其中一个变量消除规则是已知的破三角性质,而其他三个是新的。三个值消去规则都可以看作是邻域替换的严格推广。

英文摘要:

Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time identification of certain variables (domain elements) whose elimination, without the introduction of extra compensatory constraints, does not affect the satisfiability of an instance. We show that there are essentially just four variable elimination rules and three value elimination rules defined by forbidding generic sub-instances, known as irreducible existential patterns, in arc-consistent CSP instances. One of the variable elimination rules is the already-known Broken Triangle Property, whereas the other three are novel. The three value elimination rules can all be seen as strict generalisations of neighbourhood substitution.

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

↑