This web page contains material for the workshop
The constraint satisfaction problem.
Contributions from the workshop participants are available in
dvi,
postscript or
pdf.
Slides from the talk of Phokion Kolaitis
A book chapter A Logical Approach to Constraint Satisfaction, by Kolaitis and Vardi, from the book Finite Model Theory and its Applications
A survey paper A Rendezvous of Logic, Complexity, and Algebra by Chen.
A characterization of first-order constraint satisfaction problems, by Larose, Loten, and Tardif
Dualities for constraint satisfaction problems, by Bulatov, Krokhin, and Larose
Recent results on the algebraic approach to the CSP, by Bulatov and Valeriote
Tractability and learnability arising from algebras with few subpowers, by Idzak, Markovic, McKenzie, Vareriote, and Willard
On tractability and congruence distributivity, by Kiss and Valeriote
CD(4) has bounded width, by Carvalho, Dalmau, Markovic, and Maroti
Congruence modularity implies cyclic terms for finite algebras, by Barto, Kozik, Maroti, McKenzie, and Niven
Dagstuhl Seminar on Complexity of Constraints, Schloss Dagstuhl International Conference and Research Center for Computer Science, October 2006
Workshop on Universal Algebra and the Constraint Satisfaction Problem, Vanderbilt University, June 2007
------------
A list of registered participants is available.
Questions or comments to workshops@aimath.org