On tractability and congruence distributivity

Logical Methods in Computer Science

Volumn 3, Issue 2, 2007, Pages

  Kiss, Emil ^a   Valeriote, Matthew ^b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Congruence distributivity; Constraint satisfaction problem; Tractability; Universal algebra

Indexed keywords

ALGEBRA;

CONSTRAINT LANGUAGE; DISTRIBUTIVITY; FINITE ALGEBRAS; SHORT SEQUENCES; TRACTABILITY; UNIVERSAL ALGEBRA;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84962311347     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(2:6)2007     Document Type: Article

References (19)

1. Andrei Bulatov. Tractable conservative constraint satisfaction problems. In Phokion G. Kolaitis, editor, Proceedings of the Eighteenth Annual IEEE Symp. on Logic in Computer Science, LICS 2003, pages 321-330. IEEE Computer Society Press, June 2003.
2. Andrei Bulatov. A graph of a relational structure and constraint satisfaction problems. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004, pages 448-457. IEEE, 2004.
3. Andrei Bulatov. Combinatorial problems raised from 2-semilattices. Journal of Algebra, 298(2):321-339, 2006.
4. Andrei Bulatov and Peter Jeavons. Algebraic structures in combinatorial problems. submitted for publication.
5. Andrei Bulatov, Peter Jeavons, and Andrei Krokhin. Classifying the complexity of constraints using finite algebras. SIAM J. Comput., 34(3):720-742 (electronic), 2005.
6. Andrei A. Bulatov. A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM, 53(1):66-120, 2006.
7. Stanley Burris and H. P. Sankappanavar. A course in universal algebra, volume 78 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1981.
8. Matthias Clasen and Matthew Valeriote. Tame congruence theory. In Lectures on algebraic model theory, volume 15 of Fields Inst. Monogr., pages 67-111. Amer. Math. Soc., Providence, RI, 2002.
9. Victor Dalmau. Generalized majority-minority operations are tractable. In Prakash Panangaden, editor, Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, LICS 2005, pages 438-447. IEEE Computer Society Press, June 2005.
10. Tomás Feder and Moshe Y. Vardi. Monotone monadic snp and constraint satisfaction. In STOC ’93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 612-622, New York, NY, USA, 1993. ACM Press.
11. Tomás Feder and Moshe Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput., 28(1):57-104 (electronic), 1999.
12. David Hobby and Ralph McKenzie. The structure of finite algebras, volume 76 of Contemporary Mathematics. American Mathematical Society, Providence, RI, 1988. Revised edition: 1996.
13. Peter Jeavons. On the algebraic structure of combinatorial problems. Theoret. Comput. Sci., 200(1-2):185-204, 1998.
14. Peter Jeavons, David Cohen, and Martin C. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1-2):251-265, 1998.
15. Benoit Larose. Some notes on bounded widths. unpublished, 2004.
16. Benoit Larose and László Zádori. Bounded width problems and algebras. Accepted by Algebra Universalis, 2006.
17. R. McKenzie, G. McNulty, and W. Taylor. Algebras, Lattices, Varieties Volume 1. Wadsworth and Brooks/Cole, Monterey, California, 1987.
18. Thomas J. Schaefer. The complexity of satisfiability problems. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), pages 216-226. ACM, New York, 1978.
19. Matthew Valeriote. A subalgebra intersection property for congruence distributive varieties. Canadian Journal of Mathematics, accepted for publication, 2006.