Maltsev + Datalog ⇒ symmetric Datalog

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 297-306

  Dalmau, Victor ^a   Larose, Benoit ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b Civil and Environmental Engineering   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER NETWORKS; COMPUTER SCIENCE;

DATA LOGS;

COMPUTER OPERATING PROCEDURES;

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

References (20)

1. K. Baker, A. Pixley. Polynomial interpolation and the Chinese remainder theorem for algebraic systems. Math. Z. 143, (1975) 165-174.
2. A. Bulatov, P. Jeavons, and A. Krokhin. Classifying complexity of constraints using finite algebras. SIAM Journal on Computing, 34(3):720-742, 2005.
3. A. Bulatov. A dichotomy theorem for constraints on a three-element set. Proc. of 43rd Foundations of Comp. Sci. (FOCS'02), (2002), 649-658.
4. A. Bulatov. Malt'sev constraints are tractable. Research Report RR-02-05, Oxford University Computing Laboratory, April 2002, 36 pages.
5. A. Bulatov, V. Dalmau. A Simple Algorithm for Mal'tsev Constraints. SIAM J. Comput., 36, 1, (2006), 16-27.
6. C. Carvalho, V. Dalmau, P. Marković, and M. Maróti. CD(4) has bounded width. Algebra Universalis. to appear.
7. D. Cohen and P. Jeavons. The complexity of constraint languages. In Handbook of Constraint Programming, chapter 8. Else-vier, 2006.
8. V. Dalmau. Linear Datalog and bounded path duality for relational structures. Logical Methods in Computer Science, 1(1), 2005. (electronic).
9. V. Dalmau, P. G. Kolaitis, M. Y. Vardi. Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. Principles and Practice of Constraint Programming (CP'02), (2002), 310-326.
10. V. Dalmau and A. Krokhin. Majority constraints have bounded pathwidth duality. European Journal of Combinatorics, 2007. to appear.
11. L. Egri, B. Larose, and P. Tesson. Symmetric Datalog and constraint satisfaction problems in Logspace. In LICS'07, pages 193-202, 2007.
12. T. Feder and M.Y. Vardi. 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.
13. D. Hobby and R.N. McKenzie. The Structure of Finite Algebras, volume 76 of Contemporary Mathematics. AMS, Providence, R.I., 1988.
14. P. Idziak, P. Markovic, R. McKenzie, M. Valeriote, and R. Willard. Tractabil-ity and learnability arising from algebras with few subpowers. In LICS'07, pages 213-222, 2007.
15. B. Larose, P. Tesson. Universal Algebra and Hardness Results for Constraint Satisfaction Problems. (Long version of Icalp '07), 32 pages. Submitted.
16. B. Larose and L. Zádori. Bounded width problems and algebras. Algebra Universalis, 56(3-4):439-466, 2007.
17. L. Libkin. Elements of Finite Model Theory. Springer, 2004.
18. R. McKenzie, G. McNulty, W. Taylor. Algebras, Lattices and Varieties. Wadsworth and Brooks/Cole, 1987.
19. A.F. Pixley. Distributivity and per-mutability of congruence relations in equational classes of algebras. Proc. Amer. Math. Soc. 14, 105-109.
20. th ACM STOC, pages 216-226, 1978.