International Workshop on Mathematics of Constraint Satisfaction: Algebra, Logic, and Graph Theory

约束满足数学国际研讨会：代数、逻辑和图论

• 批准号: EP/D036720/1
• 负责人: Andrei Krokhin
• 金额: $ 2.59万
• 依托单位: Durham University
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2006
• 资助国家: 英国
• 起止时间: 2006 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FD036720%2F1
• 关键词: International; Workshop; Mathematics; Constraint; Satisfaction

The constraint satisfaction problem, or CSP for short, provides ageneral framework in which it is possible to express, in a naturalway, a wide variety of computational problems, including satisfiability and graph colourability. The aim in a constraint satisfaction problem is to find an assignment of values to a given set of variables, subject to constraints on the values which can be assigned simultaneously to certain specified subsets of variables.The study of constraint satisfaction problems is a very active area of research. It has originated in aritificial intelligence, and is now spread over various areas of computer science and mathematics. We seek funds to support an international workshop on mathematics of constraintsatisfaction which is intended to bring together specialists from many different areas of mathematics and computer science with an interest in this exciting interdisciplinary area.

约束满意度问题（或简称CSP）提供了生动框架，在这种框架中，可以在天然道路上表达各种计算问题，包括可满足性和图形可调性。约束满意度问题的目的是找到对给定变量集的值的分配，但要受到可以同时分配给某些指定变量的某些指定子集的值的约束。约束满意度问题的研究是一个非常活跃的研究领域。它起源于ARITICKENCE，现在分布在计算机科学和数学的各个领域。我们寻求资金来支持关于约束满意度数学的国际研讨会，该研讨会旨在将许多不同数学领域和计算机科学领域的专家聚集在一起，对这个令人兴奋的跨学科领域感兴趣。