Universal algebra and hardness results for constraint satisfaction problems

Theoretical Computer Science

Volumn 410, Issue 18, 2009, Pages 1629-1647

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

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

Complexity classes; Constraint satisfaction; Datalog; Universal algebra

Indexed keywords

ALGEBRA; HARDNESS; REFINING; STEELMAKING;

ALGEBRAIC CONDITIONS; COMPLEXITY CLASSES; CONSTRAINT LANGUAGES; CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION PROBLEMS; DATALOG; EXPRESSIBILITY; FINE-GRAIN ANALYSIS; FIRST ORDERS; HARDNESS RESULTS; NP-COMPLETE; SATISFIABILITY PROBLEMS; SCHAEFER'S THEOREMS; UNIVERSAL ALGEBRA;

COMPUTER OPERATING PROCEDURES;

EID: 62149100372     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.12.048     Document Type: Article

References (31)

1. F.N. Afrati, S.S. Cosmadakis, Expressiveness of restricted recursive queries, in: Proc. 21st ACM Symp. on Theory of Computing, STOC'89, 1989, pp. 113-126
2. E. Allender, M. Bauland, N. Immerman, H. Schnoor, H. Vollmer, The complexity of satisfiability problems: Refining Schaefer's theorem, in: Proc. 30th Math. Found. of Comp. Sci., MFCS'05, 2005, pp. 71-82
3. A. Atserias, On digraph coloring problems and treewidth duality, in: Proc. 21st Conf. on Logic in Comp. Sci., LICS'05, 2005, pp. 106-115
4. A. Atserias, A. Bulatov, A. Dawar, Affine systems of equations and counting infinitary logic, in: Proc. 34th Int. Conf. on Automata, Languages and Programming, ICALP'07, 2007, pp. 558-570
5. A. Bulatov, A dichotomy theorem for constraints on a three-element set, in: Proc. of 43rd Foundations of Comp. Sci., FOCS'02, 2002, pp. 649-658
6. A. Bulatov, Tractable conservative constraint satisfaction problems, in: 18th IEEE Symp. on Logic in Comp. Sci., LICS 2003, 2003, pp. 321-331
7. A. Bulatov, A. Krokhin, P. Jeavons, Constraint satisfaction problems and finite algebras, in: Proc. 27th Int. Coll. on Automata, Languages and Programming, ICALP'00, 2000, pp. 272-282
8. Buntrock G., Damm C., Hertrampf U., and Meinel C. Structure and importance of logspace-MOD classes. Math. Syst. Theory 25 3 (1992) 223-237
9. Cohen D., and Jeavons P.G. The complexity of constraint languages. Handbook of Constraint Programming (2006)
10. Cook S.A., and Sethi R. Storage requirements for deterministic polynomial time recognizable languages. J. Comput. System Sci. 13 1 (1976) 25-37
11. Dalmau V. Linear Datalog and bounded path duality of relational structures. Logical Methods Comput. Sci. 1 1 (2005)
12. Denecke K., and Wismath S.L. Universal Algebra and Applications in Theoretical Computer Science (2002), CRC/C&H
13. L. Egri, B. Larose, P. Tesson, Symmetric datalog and constraint satisfaction problems in logspace, in: Proc. 22nd Symp. on Logic in Comp. Sci., LICS-07, pp. 193-202
14. L. Egri, B. Larose, P. Tesson, Symmetric datalog and constraint satisfaction problems in logspace, in: Proc. 35th Int. Conf. on Automata, Languages and Programming, ICALP'08, 2008
15. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Comput. 28 1 (1999) 57-104
16. T. Feder, M.Y. Vardi, Homomorphism closed vs. existential positive, in: Proc. 18th Symp. on Logic in Comp. Sci., LICS 2003, 2003, pp. 311-320
17. Furst M., Saxe J.B., and Sipser M. Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17 1 (1984) 13-27
18. Hobby D., and McKenzie R. The Structure of Finite Algebras. Contemporary Mathematics vol. 76 (1988), American Mathematical Society
19. Immerman N. Descriptive Complexity. Graduate Texts in Computer Science (1999), Springer
20. Jeavons P. On the algebraic structure of combinatorial problems. Theoret. Comput. Sci. 200 1-2 (1998) 185-204
21. Kolaitis P.G., and Vardi M.Y. On the expressive power of datalog: Tools and a case study. J. Comput. System Sci. 51 1 (1995) 110-134
22. Larose B., Loten C., and Tardif C. A characterization of first-order constraint satisfaction problems. Logical Methods Comput. Sci. 3 4 (2007)
23. Larose B., and Zádori L. Finite posets and topological spaces in locally finite varieties. Algebra Universalis 52 2-3 (2005) 119-136
24. Larose B., and Zádori L. Bounded width problems and algebras. Algebra Universalis 56 3-4 (2007) 439-466
25. Libkin L. Elements of Finite Model Theory (2004), Springer Verlag
26. O. Reingold, Undirected st-connectivity in log-space, in: Proc. 37th ACM Symp. on Theory of Computing, STOC'05, 2005, pp. 376-385
27. B. Rossman, Existential positive types and preservation under homomorphisisms, in: Proc. 21st Conf. on Logic in Comp. Sci., LICS'05, 2005, pp. 467-476
28. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. 10th ACM STOC, 1978, pp. 216-226
29. Szendrei A. A survey on strictly simple algebras and minimal varieties. Research and Exposition in Mathematics (1992), Heldermann Verlag 209-239
30. Ullman J. Database and Knowledge-Base Systems (1989), Computer Science Press
31. M. Valeriote, A subalgebra intersection property for congruence distributive varieties, Canad. J. Math., 2007, in press (http://journals.cms.math.ca/cgi-bin/vault/viewprepub/valeriote7024.prepub)