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

约束满足问题（简称CSP）提供了一个通用框架，在这个框架中，可以自然地表达各种各样的计算问题，包括可满足性和图形可着色性。约束满足问题的目的是找到给定变量集的值赋值，这些值受约束，可以同时赋值给某些指定的变量子集。约束满足问题的研究是一个非常活跃的研究领域。它起源于人工智能，现在已经扩展到计算机科学和数学的各个领域。我们寻求资金支持一个关于约束满足数学的国际研讨会，该研讨会旨在汇集来自数学和计算机科学许多不同领域的专家，他们对这个令人兴奋的跨学科领域感兴趣。

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.