Universal algebra and hardness results for constraint satisfaction problems

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

Volumn 4596 LNCS, Issue , 2007, Pages 267-278

  Larose, Benoît ^a   Tesson, Pascal ^b  

^a Gina Cody School of Engineering and Computer Science

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING;

CONGRUENCE THEORY; CONSTRAINT SATISFACTION PROBLEMS; DICHOTOMY CONJECTURE;

ALGEBRA;

EID: 38149070894     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_25     Document Type: Conference Paper

References (20)

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. Atserias, A.: On digraph coloring problems and treewidth duality. In: Proc. 21st Conf. on Logic in Comp. Sci. (LICS '05), pp. 106-115 (2005)
3. Bulatov, A., Krokhin, A., Jeavons, P.: Constraint satisfaction problems and finite algebras. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 272-282. Springer, Heidelberg (2000)
4. Cohen, D., Jeavons, P.G.: The complexity of constraint languages. In: Handbook of Constraint Programming (2006)
5. Dalmau, V.: Linear Datalog and bounded path duality of relational structures. Logical Methods in Computer Science 1(1) (2005)
6. Dalmau, V., Egri, L., Larose, B., Tesson, P.: On the limits of expressivity of linear and symmetric Datalog. Document in preparation (2007)
7. Denecke, K., Wismath, S.L.: Universal Algebra and Applications in Theoretical Computer Science. CRC/C&H, Boca Raton (2002)
8. Egri, L., Larose, B., Tesson, P.: Symmetric datalog and constraint satisfaction problems in logspace (Submitted, 2007)
9. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. on Computing 28(1), 57-104 (1999)
10. Feder, T., Vardi, M.Y.: Homomorphism closed vs. existential positive. In: Feder, T., Vardi, M.Y. (eds.) Proc. 18th Symp. on Logic in Comp. Sei (LICS 2003), pp. 311-320 (2003)
11. Hobby, D., McKenzie, R.: The Structure of Finite Algebras. Contemporary Mathematics, vol. 76. American Mathematical Society, New York (1988)
12. Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, Heidelberg (1999)
13. Jeavons, P.: On the algebraic structure of combinatorial problems. Theor. Comput. Sci. 200(1-2), 185-204 (1998)
14. Kolaitis, P.G., Vardi, M.Y.: On the expressive power of datalog: Tools and a case study. J. Comput. Syst. Sci. 51(1), 110-134 (1995)
15. Larose, B., Loten, C., Tardif, C.: A characterization of first-order constraint satisfaction problems. In: Proc. 21st Symp. on Logic in Comp, pp. 201-210 (2006)
16. Larose, B., Zádori, L.: Finite posets and topological spaces in locally finite varieties. Algebra Universalis 52(2-3), 119-136 (2005)
17. Larose, B., Zádori, L.: Bounded width problems and algebras. Algebra Universalis (2006)
18. th ACM STOC, pp. 216-226. ACM Press, New York (1978)
19. Szendrei, A.: A survey on strictly simple algebras and minimal varieties. Research and Exposition in Mathematics, pp. 209-239. Heldermann Verlag (1992)
20. Valeriote, M.: A subalgebra intersection property for congruence distributive varieties. In: Canadian J. of Math, (to appear)