Abstract
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. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Bulatov, A. A., Krokhin, A., & Larose, B. (2008). Dualities for constraint satisfaction problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5250 LNCS, pp. 93–124). https://doi.org/10.1007/978-3-540-92800-3_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
