chapter

Dualities for Constraint Satisfaction Problems

Authors:

Andrei A. Bulatov,

Andrei Krokhin,

Benoit LaroseAuthors Info & Claims

Complexity of Constraints: An Overview of Current Research Themes

December 2008

Pages 93 - 124

https://doi.org/10.1007/978-3-540-92800-3_5

Published: 23 December 2008 Publication History

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.

References

[1]

Afrati, F., Cosmodakis, S.: Expressiveness of restricted recursive queries. In: STOC 1989, pp. 113-126 (1989)

[2]

Atserias, A.: On digraph coloring problems and treewidth duality. European Journal of Combinatorics 29(4), 796-820 (2008)

Digital Library

[3]

Atserias, A., Bulatov, A., Dawar, A.: Affine systems of equations and counting infinitary logic. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 558-570. Springer, Heidelberg (2007)

[4]

Bodirsky, M.: Constraint satisfaction problems with infinite templates. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250. Springer, Heidelberg (2008)

[5]

Bodirsky, M., Dalmau, V.: Datalog and constraint satisfaction with infinite templates. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 646-659. Springer, Heidelberg (2006)

[6]

Bodirsky, M., Dalmau, V.: Datalog and constraint satisfaction with infinite templates (2008) arXiv: 0809.2386v1

[7]

Bulatov, A.: Tractable conservative constraint satisfaction problems. In: LICS 2003, pp. 321-330 (2003)

Digital Library

[8]

Bulatov, A.: A graph of a relational structure and constraint satisfaction problems. In: LICS 2004, pp. 448-457 (2004)

[9]

Bulatov, A.: Combinatorial problems raised from 2-semilattices. Journal of Algebra 298(2), 321-339 (2006)

[10]

Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3- element set. Journal of the ACM 53(1), 66-120 (2006)

Digital Library

[11]

Bulatov, A., Jeavons, P.: Algebraic structures in combinatorial problems. Technical Report MATH-AL-4-2001, Technische Universität Dresden, Germany (2001)

[12]

Bulatov, A., Jeavons, P., Krokhin, A.: Classifying complexity of constraints using finite algebras. SIAM Journal on Computing 34(3), 720-742 (2005)

Digital Library

[13]

Bulatov, A., Valeriote, M.: Recent results on the algebraic approach to the CSP. In: Creignou, N., Kolaitis, P., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 68-92. Springer, Heidelberg (2008)

[14]

Carvalho, C., Dalmau, V., Krokhin, A.: Caterpillar duality for constraint satisfaction problems. In: LICS 2008, pp. 307-316 (2008)

Digital Library

[15]

Carvalho, C., Dalmau, V., Marković, P., Maróti, M.: CD(4) has bounded width. Algebra Universalis (accepted)

[16]

Clasen, M., Valeriote, M.: Tame congruence theory. In: Lectures on Algebraic Model Theory. Fields Institute Monographs, vol. 15, pp. 67-111 (2002)

[17]

Cohen, D., Jeavons, P.: The complexity of constraint languages. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch. 8. Elsevier, Amsterdam (2006)

[18]

Cooper, M.C., Cohen, D.A., Jeavons, P.G.: Characterising tractable constraints. Artificial Intelligence 65, 347-361 (1994)

Digital Library

[19]

Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7 (2001)

Digital Library

[20]

Dalmau, V.: Linear Datalog and bounded path duality for relational structures. Logical Methods in Computer Science 1(1) (2005) (electronic)

[21]

Dalmau, V.: There are no pure relational width 2 constraint satisfaction problems (submitted, 2008)

[22]

Dalmau, V., Krokhin, A.: Majority constraints have bounded pathwidth duality. European Journal of Combinatorics 29(4), 821-837 (2008)

Digital Library

[23]

Dalmau, V., Larose, B.: Maltsev + Datalog ⇒ Symmetric Datalog. In: LICS 2008, pp. 297-306 (2008)

Digital Library

[24]

Dalmau, V., Pearson, J.: Set functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 159-173. Springer, Heidelberg (1999)

[25]

Egri, L., Larose, B., Tesson, P.: Symmetric Datalog and constraint satisfaction problems in Logspace. In: LICS 2007, pp. 193-202 (2007)

Digital Library

[26]

Feder, T.: Classification of homomorphisms to oriented cycles and of k-partite satisfiability. SIAM Journal on Discrete Mathematics 14(4), 471-480 (2001)

Digital Library

[27]

Feder, T., Hell, P., Huang, J.: Bi-arc graphs and the complexity of list homomorphisms. Journal of Graph Theory 42, 61-80 (2003)

Digital Library

[28]

Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57-104 (1998)

Digital Library

[29]

Feder, T., Vardi, M.Y.: Homomorphism closed vs. existential positive. In: Proc. 18th IEEE Symp. on Logic in Computer Science, LICS 2003, pp. 311-320 (2003)

[30]

Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory 17(1), 13-27 (1984)

[31]

Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

[32]

Hell, P.: From graph colouring to constraint satisfaction: there and back again. In: Topics in Discrete Mathematics. Algorithms and Combinatorics, vol. 26, pp. 407-432. Springer, Heidelberg (2006)

[33]

Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Ser. B 48, 92-110 (1990)

Digital Library

[34]

Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)

[35]

Hell, P., Nešetřil, J., Zhu, X.: Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc. 348, 147-156 (1996)

[36]

Hell, P., Nešetřil, J., Zhu, X.: Duality of graph homomorphisms. In: Combinatorics, Paul Erdös is Eighty. Bolyai Soc. Math. Stud., vol. 2, pp. 271-282. János Bolyai Math. Soc. (1996)

[37]

Hell, P., Zhou, H., Zhu, X.: On homomorphisms to acyclic local tournaments. Journal of Graph Theory 20(4), 467-471 (1995)

Digital Library

[38]

Hell, P., Zhu, X.: Homomorphisms to oriented paths. Discrete Mathematics 132, 107-114 (1994)

Digital Library

[39]

Hell, P., Zhu, X.: The existence of homomorphisms to oriented cycles. SIAM Journal on Discrete Mathematics 8, 208-222 (1995)

Digital Library

[40]

Hobby, D., McKenzie, R.N.: The Structure of Finite Algebras. Contemporary Mathematics, vol. 76. American Mathematical Society, Providence (1988)

[41]

Idziak, P., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. In: LICS 2007, pp. 213-222 (2007)

Digital Library

[42]

Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200, 185-204 (1998)

Digital Library

[43]

Jeavons, P.G., Cohen, D.A., Cooper, M.C.: Constraints, consistency and closure. Artificial Intelligence 101(1-2), 251-265 (1998)

Digital Library

[44]

Kiss, E.W., Valeriote, M.: On tractability and congruence distributivity. Logical Methods in Computer Science 3(2) (2007) (electronic)

[45]

Kolaitis, P.G.: On the expressive power of logics on finite models. In: Finite Model Theory and its Applications. EATCS Series: Texts in Theoretical Computer Science, pp. 27-124. Springer, Heidelberg (2007)

[46]

Kolaitis, P.G., Vardi, M.Y.: On the expressive power of Datalog: tools and a case study. Journal of Computer and System Sciences 51, 110-134 (1995)

Digital Library

[47]

Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61, 302-332 (2000)

Digital Library

[48]

Kolaitis, P.G., Vardi, M.Y.: A logical approach to constraint satisfaction. In: Finite Model Theory and its Applications. EATCS Series: Texts in Theoretical Computer Science, pp. 339-370. Springer, Heidelberg (2007)

[49]

Komárek, P.: Some new good characterisations of directed graphs. Časopis Pěst. Mat. 51, 348-354 (1984)

[50]

Krokhin, A., Bulatov, A., Jeavons, P.: The complexity of constraint satisfaction: an algebraic approach. In: Structural Theory of Automata, Semigroups, and Universal Algebra. NATO Science Series II: Math., Phys., Chem., vol. 207, pp. 181-213. Springer, Heidelberg (2005)

[51]

Larose, B., Loten, C., Tardif, C.: A characterisation of first-order constraint satisfaction problems. Logical Methods in Computer Science 3(4) (2007) (electronic)

[52]

Larose, B., Tesson, P.: Universal algebra and hardness results for constraint satisfaction problems. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 267-278. Springer, Heidelberg (2007)

[53]

Larose, B., Valeriote, M., Zádori, L.: Omitting types, bounded width and the ability to count (submitted, 2008)

[54]

Larose, B., Zádori, L.: Bounded width problems and algebras. Algebra Universalis 56(3-4), 439-466 (2007)

[55]

Libkin, L.: Elements of Finite Model Theory. EATCS Series: Texts in Theoretical Computer Science. Springer, Heidelberg (2004)

[56]

Loten, C., Tardif, C.: Majority functions on structures with finite duality. European Journal of Combinatorics 29(4), 979-986 (2008)

Digital Library

[57]

Maróti, M., McKenzie, R.: Existence theorems for weakly symmetric operations. In: Algebra Universalis (to appear, 2007)

[58]

Nešetřil, J., Pultr, A.: On classes of relations and graphs determined by subobjects and factorobjects. Discrete Mathematics 22, 287-300 (1978)

[59]

Nešetřil, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). Journal of Combinatorial Theory, Ser. B 80, 80-97 (2000)

Digital Library

[60]

Nešetřil, J., Tardif, C.: Short answers to exponentially long questions: extremal aspects of homomorphism duality. SIAM Journal on Discrete Mathematics 19(4), 914-920 (2005)

Digital Library

[61]

Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)

[62]

Rossman, B.: Existential positive types and preservation under homomorphisms. In: LICS 2005, pp. 467-476 (2005)

[63]

Szendrei, A.: Clones in Universal Algebra. Seminaires de Mathematiques Superieures, vol. 99. University of Montreal (1986)

[64]

Valeriote, M.: A subalgebra intersection property for congruence-distributive varieties. Canadian Journal of Mathematics (to appear, 2007)

[65]

Zádori, L.: Posets, near-unanimity functions and zigzags. Bulletin of the Australian Mathematical Society 47, 79-93 (1993)

Cited By

Dalmau VOpršal JSobocinski PLago UEsparza J(2024)Local consistency as a reduction between constraint satisfaction problemsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662068(1-15)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662068
Mezei BWrochna MŽivný s(2023)PTAS for Sparse General-valued CSPsACM Transactions on Algorithms10.1145/356995619:2(1-31)Online publication date: 9-Mar-2023
https://dl.acm.org/doi/10.1145/3569956
Krokhin AOpršal J(2022)An invitation to the promise constraint satisfaction problemACM SIGLOG News10.1145/3559736.35597409:3(30-59)Online publication date: 25-Aug-2022
https://dl.acm.org/doi/10.1145/3559736.3559740
Show More Cited By

Dualities for Constraint Satisfaction Problems
1. Information systems
  1. Data management systems
    1. Database administration
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

The Optimization Complexity of Constraint Satisfaction Problems
Hard constraint satisfaction problems have hard gaps at location 1

An instance of the maximum constraint satisfaction problem (Max CSP) is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures many ...
Constraint structure in constraint satisfaction problems

Comments

Information & Contributors

Information

Published In

cover image Guide books

Complexity of Constraints: An Overview of Current Research Themes

December 2008

319 pages

ISBN:9783540927990

Editors:
Nadia Creignou
LIF (CNRS UMR 6166), Aix-Marseille Université, Marseille, France F-13288
,
Phokion G. Kolaitis
IBM Almaden Research Center, Computer Science Principles and Methodologies, and Computer Science Department, University of California, Santa Cruz, USA
,
Heribert Vollmer
Institut für Theoretische Informatik, Leibniz, Universität Hannover, Hannover, Germany 30167

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 December 2008

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dalmau VOpršal JSobocinski PLago UEsparza J(2024)Local consistency as a reduction between constraint satisfaction problemsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662068(1-15)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662068
Mezei BWrochna MŽivný s(2023)PTAS for Sparse General-valued CSPsACM Transactions on Algorithms10.1145/356995619:2(1-31)Online publication date: 9-Mar-2023
https://dl.acm.org/doi/10.1145/3569956
Krokhin AOpršal J(2022)An invitation to the promise constraint satisfaction problemACM SIGLOG News10.1145/3559736.35597409:3(30-59)Online publication date: 25-Aug-2022
https://dl.acm.org/doi/10.1145/3559736.3559740
Barto LBulín JKrokhin AOpršal J(2021)Algebraic Approach to Promise Constraint SatisfactionJournal of the ACM10.1145/345760668:4(1-66)Online publication date: 14-Jul-2021
https://dl.acm.org/doi/10.1145/3457606
Mezei BWrochna MŽivný SGorla D(2021)PTAS for sparse general-valued CSPsProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470599(1-11)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470599
Barto LBrady ZBulatov AKozik MZhuk DGorla D(2021)Minimal taylor algebras as a common framework for the three algebraic approaches to the CSPProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470557(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470557
Bulatov A(2018)Constraint satisfaction problemsACM SIGLOG News10.1145/3292048.32920505:4(4-24)Online publication date: 12-Nov-2018
https://dl.acm.org/doi/10.1145/3292048.3292050
Barceló PKröll MPichler RSkritek S(2018)Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with ProjectionACM Transactions on Database Systems10.1145/323398343:2(1-44)Online publication date: 21-Aug-2018
https://dl.acm.org/doi/10.1145/3233983
Bulatov AAceto LIngólfsdóttir A(2017)Constraint satisfaction problems over semilattice block Mal'tsev algebrasProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330084(1-11)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330084
Dalmau VKozik MKrokhin AMakarychev KMakarychev YOpršal JKlein P(2017)Robust algorithms with polynomial loss for near-unanimity CSPsProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039708(340-357)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039708
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten