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

点击翻译按钮获取中文摘要

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.