Symmetric datalog and constraint satisfaction problems in logspace

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 193-202

  Egri, Lászlo ^a   Larose, Benoit ^b   Tesson, Pascal ^c  

^a MCGILL UNIVERSITY   (Canada)

^b Dept of Electrical and Computer Engineering   (Canada)

^c UNIVERSITÉ LAVAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT LANGUAGE; CONSTRAINT SATISFACTION PROBLEMS; DATALOG; EXPRESSIVE POWER; FINITE SUBSETS; FIRST-ORDER; LOGSPACE;

AUTOMATA THEORY; COMPUTER SCIENCE;

CONSTRAINT THEORY;

EID: 51549090059     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.47     Document Type: Conference Paper

References (20)

1. E. Allender, M. Bauland, N. Immerman, H. Schnoor, and H. Vollmer. The complexity of satisfiability problems: Refining Schaefer's theorem. In Proc. 30th Math. Found. of Comp. Sci. (MFCS'05), pages 71-82, 2005. (Pubitemid 41449490)
2. A. Atserias. On digraph coloring problems and treewidth duality. In Proc. 21st Conf. on Logic in Comp. Sci. (LICS'05), pages 106-115, 2005. (Pubitemid 41462558)
3. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proc. of 43rd Foundations of Comp. Sci. (FOCS'02), pages 649-658, 2002.
4. A. Bulatov. Tractable conservative constraint satisfaction problems. In 18th IEEE Symp. on Logic in Comp. Sci. (LICS 2003), pages 321-331, 2003.
5. D. Cohen and P. G. Jeavons. The complexity of constraint languages. In Handbook of Constraint Programming, 2006.
6. M. Cooper, D. Jeavons, and P. Jeavons. Characterizing tractable constraints. Artificial Intelligence, 65:347-361, 1994.
7. V. Dalmau. Linear Datalog and bounded path duality of relational structures. Logical Methods in Computer Science, 1(1), 2005.
8. V. Dalmau, L. Egri, B. Larose, and P. Tesson. On the limits of expressivity of linear and symmetric Datalog. Document in preparation, 2007.
9. V. Dalmau, P. G. Kolaitis, and M. Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Principles and Practice of Constraint Programming (CP'02), pages 310-326, 2002.
10. T. Feder and M. Y. Vardi. 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. (Pubitemid 128491791)
11. E. Grädel. Capturing complexity classes by fragments of second-order logic. Theor. Comput. Sci., 101(1):35-57, 1992.
12. N. Immerman. Descriptive Complexity. Graduate Texts in Computer Science. Springer, 1999.
13. L. Kirousis. Fast parallel constraint satisfaction. Artificial Intelligence, 64:147-160, 1993.
14. B. Larose, C. Loten, and C. Tardif. A characterization of first-order constraint satisfaction problems. In Proc. 21st Symp. on Logic in Comp. Sci. (LICS-06), pages 201-210, 2006. (Pubitemid 47130366)
15. B. Larose and P. Tesson. Universal algebra and hardness results for constraint satisfaction problems. In Proc. 34th Int. Conf. on Automata, Languages and Programming (ICALP'07), 2007.
16. L. Libkin. Elements of Finite Model Theory. Springer Verlag, 2004.
17. O. Reingold. Undirected st-connectivity in log-space. In Proc. 37th ACM Symp. on Theory of Computing (STOC'05), pages 376-385, 2005. (Pubitemid 43098608)
18. th ACM STOC, pages 216-226, 1978.
19. A. Szendrei. Clones in Universal Algebra. Presses de l'Université de Montréal, 1986.
20. A. Szendrei. A survey on strictly simple algebras and minimal varieties, pages 209-239. Research and Exposition in Mathematics. Heldermann Verlag, 1992.