Applications of algebra and topology to constraint satisfaction problems

代数和拓扑在约束满足问题中的应用

• 批准号: 238899-2006
• 负责人: Larose, Benoît
• 金额: $ 0.8万
• 依托单位: Concordia University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2007
• 资助国家: 加拿大
• 起止时间: 2007-01-01 至 2008-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=362446
• 关键词: Applications; algebra; topology; constraint; satisfaction

In a constraint satisfaction problem (CSP), one must assign values to variables that must obey various constraints; typical real world examples include scheduling problems and database queries. In general, determining whether a CSP admits a solution is an algorithmic challenge, but it often happens in practice that the constraints are of a very restricted form, allowing the use of efficient methods to solve the CSP. Our long-term goal is to classify precisely what kinds of restrictions lead to these tractable CSP's. Our approach is based on an unexpected and fruitful connection between CSP's and universal algebra that was uncovered in the late 90's by P. Jeavons. In short, every family of constraints is transformed into a mathematical object whose algebraic properties somehow reflect the difficulty of solving the CSP. Further methods borrowed from the field of algebraic topology are used to analyse these algebraic objects. This algebraic approach has led to some major breakthroughs in the last 5 years in the study of the algorithmic complexity of constraint satisfaction problems.

在约束满足问题（CSP）中，必须为必须遵守各种约束的变量分配值;典型的真实的世界示例包括调度问题和数据库查询。一般来说，确定CSP是否承认解决方案是一个算法挑战，但在实践中经常发生的是，约束是一个非常有限的形式，允许使用有效的方法来解决CSP。我们的长期目标是准确地分类哪些类型的限制导致这些易处理的CSP。我们的方法是基于一个意想不到的和富有成效的CSP的和通用代数之间的连接，发现在90年代后期的P。简而言之，每个约束族都被转换成一个数学对象，其代数属性在某种程度上反映了求解CSP的难度。借用代数拓扑领域的进一步方法来分析这些代数对象。这种代数方法导致了一些重大突破，在过去5年中的算法复杂性的约束满足问题的研究。