This workshop encourages the submission of interesting theoretical and mathematical results related to constraints. Topics include (but are not limited to):

1. • The theoretical relationship between classes of CSPs and other problems.
   

2. • Complexity and expressivity of different constraint representations.
   

3. • Complexity and expressivity in the context of propagation.
   

4. • Graphs and hypergraphs, relational structures.
   

5. • Tractability of CSPs.
   

There is no requirement for submissions to demonstrate immediate practical application of the results. Submissions should be up to 15 pages LLNCS format, but short submissions with interesting results are very welcome.

This workshop will be of particular interest to more theoretical CP researchers and mathematicians in related fields. The mathematical foundations of constraint programming is a large and active research area which has not previously been represented as a CP workshop.