Dualities for Constraint Satisfaction Problems

In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give an overview of logical, combinatorial, and algebraic aspects of the following forms of duality for constraint satisfaction problems: finite duality, bounded pathwidth duality, and bounded treewidth duality.

• Type: Conference
• Year: 2008
• Where: DAGSTUHL
• Authors: Andrei A. Bulatov, Andrei A. Krokhin, Benoit Larose
• Keywords: Constraint Satisfaction Problems, DAGSTUHL 2008, Pathwidth Duality, Software Engineering, Treewidth Duality