Recent results on the algebraic approach to the CSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5250 LNCS, Issue , 2008, Pages 68-92

  Bulatov, Andrei A ^a   Valeriote, Matthew A ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC APPROACHES; ALGEBRAIC FRAMEWORKS; CONSTRAINT SATISFACTION PROBLEMS;

COMPUTER OPERATING PROCEDURES;

EID: 59149098893     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92800-3_4     Document Type: Conference Paper

References (40)

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)
2. Berman, J., Idziak, P., Markovi'c, P., McKenzie, R., Valeriote, M., Willard, R.: Varieties with few subalgebras of powers. Journal of the AMS (to appear)
3. Berman, J.D., Kiss, E.W., Pröhle, P., Szendrei, 'A.: The set of types of a finitely generated variety. Discrete Math. 112(1-3), 1-20 (1993)
4. Baker, K.A., Pixley, A.F.: Polynomial interpolation and the chinese remainder theorem. Mathematische Zeitschrift 143, 165-174 (1975)
5. Bulatov, A.A.: Mal'tsev constraints are tractable. Technical Report PRG-RR-02- 05, Computing Laboratory, University of Oxford, Oxford, UK (2002)
6. Bulatov, A.A.: Combinatorial problems raised from 2-semilattices. Journal of Algebra 298(2), 321-339 (2006)
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)
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)
10. Bulatov, A.A.: A graph of a relational structure and constraint satisfaction problems. In: LICS, pp. 448-457 (2004)
11. Bulatov, A.A.: H-coloring dichotomy revisited. Theor. Comput. Sci. 349(1), 31-39 (2005)
12. Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3- element set. J. ACM 53(1), 66-120 (2006)
13. Bulatov, A.A., Dalmau, V.: A simple algorithm for Mal'tsev constraints. SIAM J. Comput. 36(1), 16-27 (2006)
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)
15. Atserias, A., Bulatov, A., Dawar, A.: Affine systems of equations and counting infinitary logic. In: Arge, L., Cachin, C., Jurdzi'nski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596. Springer, Heidelberg (2007)
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)
17. Burris, S., Sankappanavar, H.P.: A course in universal algebra. Graduate Texts in Mathematics, vol. 78. Springer, New York (1981)
18. Chen, H.: The expressive rate of constraints. Ann. Math. Artif. Intell. 44(4), 341- 352 (2005)
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)
20. Dalmau, V.: A new tractable class of constraint satisfaction problems. Annals of Mathematics and Artificial Intelligence 44(1-2), 61-85 (2005)
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)
22. Dalmau, V.: Generalized majority-minority operations are tractable. In: LICS, pp. 438-447 (2005)
23. Dalmau, V., Gavaldà, R., Tesson, P., Th'erien, D.: Tractable clones of polynomials over semigroups. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 196-210. Springer, Heidelberg (2005)
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)
25. Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Ser. B 48, 92-110 (1990)
26. Hobby, D., McKenzie, R.N.: The Structure of Finite Algebras. Contemporary Mathematics, vol. 76. American Mathematical Society, Providence (1988)
27. Idziak, P., Markovi'c, 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)
28. Jeavons, P.G.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200, 185-204 (1998)
29. Jeavons, P.G., Cohen, D.A., Cooper, M.C.: Constraints, consistency and closure. Artificial Intelligence 101(1-2), 251-265 (1998)
30. Jeavons, P.G., Cohen, D.A., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44, 527-548 (1997)
31. Jeavons, P.G., Cohen, D.A., Pearson, J.K.: Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence 24, 51-67 (1998)
32. Larose, B., Loten, C., Tardif, C.: A characterisation of first-order constraint satisfaction problems. In: LICS, pp. 201-210 (2006)
33. Larose, B., Tesson, P.: Universal algebra and hardness results for constraint satisfaction problems. In: Arge, L., Cachin, C., Jurdzi'nski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 267-278. Springer, Heidelberg (2007)
34. Larose, B., Zadori, L.: Bounded width problems and algebras. Algebra Universalis 56(3-4), 439-466 (2007)
35. Markovi'c, P., McKenzie, R.: Few subpowers, congruence distributivity and nearunanimity. Algebra Universalis 58(2), 119-128 (2008)
36. McKenzie, R.N., McNulty, G.F., Taylor, W.F.: Algebras, Lattices and Varieties, vol. I. Wadsworth and Brooks, California (1987)
37. McKenzie, R., Mar'oti, M.: Existence theorems for weakly symmetric operations. In: Algebra Universalis (to appear, 2006)
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)
39. Szendrei, A.: Clones in Universal Algebra. Seminaires de Mathematiques Superieures, vol. 99. Universit'e de M'ontreal (1986)
40. Valeriote, M.: A subalgebra intersection property for congruence distributive varieties. Canadian Journal of Mathematics (accepted, 2006)