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.