Skip to main content
SpringerLink
Log in
Book cover

Complexity of Constraints pp 68–92Cite as

Recent Results on the Algebraic Approach to the CSP

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5250))

Abstract

We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic framework.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: Refining schaefer’s theorem. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 71–82. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Berman, J., Idziak, P., Marković, P., McKenzie, R., Valeriote, M., Willard, R.: Varieties with few subalgebras of powers. Journal of the AMS (to appear)

    Google Scholar 

  3. Berman, J.D., Kiss, E.W., Pröhle, P., Szendrei, Á.: The set of types of a finitely generated variety. Discrete Math. 112(1-3), 1–20 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baker, K.A., Pixley, A.F.: Polynomial interpolation and the chinese remainder theorem. Mathematische Zeitschrift 143, 165–174 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bulatov, A.A.: Mal’tsev constraints are tractable. Technical Report PRG-RR-02-05, Computing Laboratory, University of Oxford, Oxford, UK (2002)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Bulatov, A.A., Jeavons, P.G.: Tractable constraints closed under a binary operation. Technical Report PRG-TR-12-00, Computing Laboratory, University of Oxford, Oxford, UK (2000)

    Google Scholar 

  8. Bulatov, A.A., Jeavons, P.G.: Algebraic structures in combinatorial problems. Technical Report MATH-AL-4-2001, Technische universität Dresden, Dresden, Germany (2001), http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/publications/index.html

  9. Bulatov, A.A., Jeavons, P.G., Volkov, M.V.: Finite semigroups imposing tractable constraints. In: Gomes, G.M.S., Pin, J.-E., Silva, P.V. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 313–329. World Scientific, Singapore (2002)

    Chapter  Google Scholar 

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

    Google Scholar 

  11. Bulatov, A.A.: H-coloring dichotomy revisited. Theor. Comput. Sci. 349(1), 31–39 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Bulatov, A.A., Dalmau, V.: A simple algorithm for Mal’tsev constraints. SIAM J. Comput. 36(1), 16–27 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Bulatov, A.A., Jeavons, P., Krokhin, A.A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3), 720–742 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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. Springer, Heidelberg (2007)

    Google Scholar 

  16. Bulatov, A.A., Krokhin, A.A., Larose, B.: Dualities for Constraint Satisfaction Problems. In: Creignou, N., Kolaitis, P., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 93–124. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Burris, S., Sankappanavar, H.P.: A course in universal algebra. Graduate Texts in Mathematics, vol. 78. Springer, New York (1981)

    MATH  Google Scholar 

  18. Chen, H.: The expressive rate of constraints. Ann. Math. Artif. Intell. 44(4), 341–352 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Clasen, M., Valeriote, M.: Tame congruence theory. In: Lectures on algebraic model theory. Fields Inst. Monogr., vol. 15, pp. 67–111. Amer. Math. Soc., Providence (2002)

    Google Scholar 

  20. Dalmau, V.: A new tractable class of constraint satisfaction problems. Annals of Mathematics and Artificial Intelligence 44(1-2), 61–85 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Dalmau, V.: Computational Complexity of Problems over Generalised Formulas. Ph.D thesis, Department LSI of the Universitat Politecnica de Catalunya (UPC), Barcelona (March 2000)

    Google Scholar 

  22. Dalmau, V.: Generalized majority-minority operations are tractable. In: LICS, pp. 438–447 (2005)

    Google Scholar 

  23. Dalmau, V., Gavaldà, R., Tesson, P., Thérien, D.: Tractable clones of polynomials over semigroups. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 196–210. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. 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)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  27. Idziak, P., Marković, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. In: LICS 2007: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, Washington, DC, USA, pp. 213–224. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  30. Jeavons, P.G., Cohen, D.A., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44, 527–548 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  31. Jeavons, P.G., Cohen, D.A., Pearson, J.K.: Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence 24, 51–67 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  32. Larose, B., Loten, C., Tardif, C.: A characterisation of first-order constraint satisfaction problems. In: LICS, pp. 201–210 (2006)

    Google Scholar 

  33. 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)

    Chapter  Google Scholar 

  34. Larose, B., Zadori, L.: Bounded width problems and algebras. Algebra Universalis 56(3-4), 439–466 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  35. Marković, P., McKenzie, R.: Few subpowers, congruence distributivity and near-unanimity. Algebra Universalis 58(2), 119–128 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  36. McKenzie, R.N., McNulty, G.F., Taylor, W.F.: Algebras, Lattices and Varieties, vol. I. Wadsworth and Brooks, California (1987)

    MATH  Google Scholar 

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

    Google Scholar 

  38. Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing (STOC 1978), pp. 216–226 (1978)

    Google Scholar 

  39. Szendrei, A.: Clones in Universal Algebra. Seminaires de Mathematiques Superieures, vol. 99. Université de Móntreal (1986)

    Google Scholar 

  40. Valeriote, M.: A subalgebra intersection property for congruence distributive varieties. Canadian Journal of Mathematics (accepted, 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Andrei A. Bulatov

  2. Department of Mathematics & Statistics, McMaster University, Hamilton, Ontario, Canada, L8S 4K1

    Matthew A. Valeriote

Authors
  1. Andrei A. Bulatov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew A. Valeriote
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIF (CNRS UMR 6166), Aix-Marseille Université, 163 avenue de Luminy, F-13288, Marseille, France

    Nadia Creignou

  2. IBM Almaden Research Center, Computer Science Principles and Methodologies, and Computer Science Department, University of California, Santa Cruz, USA

    Phokion G. Kolaitis

  3. Institut für Theoretische Informatik, Leibniz, Universität Hannover, Appelstr. 4, 30167, Hannover, Germany

    Heribert Vollmer

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bulatov, A.A., Valeriote, M.A. (2008). Recent Results on the Algebraic Approach to the CSP. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds) Complexity of Constraints. Lecture Notes in Computer Science, vol 5250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92800-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92800-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92799-0

  • Online ISBN: 978-3-540-92800-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation