arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.3210cs.AI
收藏

从约束到解析规则,第II部分:链、辫、汇合和T&E

From Constraints to Resolution Rules, Part II: chains, braids, confluence and T&E

Institut Telecom(电信学院);Telecom & Management SudParis(南巴黎电信与管理学院)

Denis Berthier

摘要:

在第二部分中,我们将第一部分中的一般理论应用于约束满足问题(CSP)的详细分析。我们展示了如何定义特定类型的解析规则。特别是,我们介绍的一般概念的链和辫子。在第一部分中,我们用数独的例子详细说明了这些概念--数独是一个NP完全问题,因此是一个典型的大类难题。对于数独,我们还展示了多远可以去“近似”CSP的分辨率理论,我们给出了一个经验统计分析的各种难题,对应于不同的条目集,可以沿着一个自然的规模的复杂性进行分类。对于任何CSP,我们还证明了一些基于辫子的解决方案理论的汇合属性,我们展示了它如何可以用来定义不同的解决方案策略。最后,我们证明了,在任何CSP,辫子有相同的解决能力,试错法(T&E)没有猜测,我们评论这个结果在数独的情况下。

英文摘要:

In this Part II, we apply the general theory developed in Part I to a detailed analysis of the Constraint Satisfaction Problem (CSP). We show how specific types of resolution rules can be defined. In particular, we introduce the general notions of a chain and a braid. As in Part I, these notions are illustrated in detail with the Sudoku example - a problem known to be NP-complete and which is therefore typical of a broad class of hard problems. For Sudoku, we also show how far one can go in 'approximating' a CSP with a resolution theory and we give an empirical statistical analysis of how the various puzzles, corresponding to different sets of entries, can be classified along a natural scale of complexity. For any CSP, we also prove the confluence property of some Resolution Theories based on braids and we show how it can be used to define different resolution strategies. Finally, we prove that, in any CSP, braids have the same solving capacity as Trial-and-Error (T&E) with no guessing and we comment this result in the Sudoku case.

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

↑