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

从约束到解析规则,第一部分:概念框架

From Constraints to Resolution Rules, Part I: Conceptual Framework

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

Denis Berthier

摘要:

许多现实世界中的问题自然地表现为约束满足问题(CSP),其中非常有效的算法是已知的。其中大多数涉及两种技术的组合:变量之间的约束的直接传播(目的是减少它们的可能值集)和某种结构化搜索(深度优先,广度优先,...)。但是,当这种盲目的搜索是不可能的或不允许的,或者当一个人想要一个“建设性的”或“基于模式的”解决方案,一个人必须设计更复杂的传播规则。在这种情况下,可以引入候选值的概念(变量的“仍然可能的”值)。在这里,我们给这个直观的概念一个定义良好的逻辑状态,从中我们可以定义归结规则和归结理论的概念。为了使我们的分析尽可能具体,我们用著名的数独例子来说明每个定义。第一部分提出了一个基于一阶逻辑的一般概念框架;随着链和辫子的引入,第二部分将给出更深入的结果。

英文摘要:

Many real world problems naturally appear as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two techniques: some direct propagation of constraints between variables (with the goal of reducing their sets of possible values) and some kind of structured search (depth-first, breadth-first,...). But when such blind search is not possible or not allowed or when one wants a 'constructive' or a 'pattern-based' solution, one must devise more complex propagation rules instead. In this case, one can introduce the notion of a candidate (a 'still possible' value for a variable). Here, we give this intuitive notion a well defined logical status, from which we can define the concepts of a resolution rule and a resolution theory. In order to keep our analysis as concrete as possible, we illustrate each definition with the well known Sudoku example. Part I proposes a general conceptual framework based on first order logic; with the introduction of chains and braids, Part II will give much deeper results.

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

↑