Congruence distributivity implies bounded width

SIAM Journal on Computing

Volumn 39, Issue 4, 2009, Pages 1531-1542

  Barto, Libor ^a   Kozik, Marcin ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

Bounded width; Congruence distributive variety; Constraint satisfaction problem; J nsson terms; Local consistency

Indexed keywords

COMPUTATION THEORY;

BOUNDED WIDTH; CONGRUENCE DISTRIBUTIVE VARIETY; CONSTRAINT LANGUAGE; DISTRIBUTIVITY; LOCAL CONSISTENCY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84893240452     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080743238     Document Type: Article

References (32)

1. J. ALLEN, Natural Language Understanding, 2nd ed., Benjamin-Cummings, Redwood City, CA, 1995.
2. L. BARTO and M. KOZIK, Constraint satisfaction problems of bounded width, in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, Atlanta, 2009, pp. 595-603.
3. L. BARTO, M. KOZIK, and T. NIVEN, Graphs, polymorphisms and the complexity of homomorphism problems, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, New York, 2008, pp. 789-796.
4. L. BARTO, M. KOZIK, and T. NIVEN, The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell), SIAM J. Comput., 38 (2009), pp. 1782-1802.
5. J. BERMAN, P. IDZIAK, P. MARKOVIĆ, R. MCKENZIE, M. VALERIOTE, and R. WILLARD, Varieties with few subalgebras of powers, Trans. Amer. Math. Soc., to appear.
6. A. BULATOV and V. DALMAU, A simple algorithm for Mal'tsev constraints, SIAM J. Comput., 36 (2006), pp. 16-27.
7. A. BULATOV, P. JEAVONS, and A. KROKHIN, Classifying the complexity of constraints using finite algebras, SIAM J. Comput., 34 (2005), pp. 720-742.
8. A. A. BULATOV, Tractable conservative constraint satisfaction problems, in Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, Ottowa, 2003, pp. 321-330.
9. A. A. BULATOV, Combinatorial problems raised from 2-semilattices, J. Algebra, 298 (2006), pp. 321-339.
10. A. A. BULATOV, A dichotomy theorem for constraint satisfaction problems on a 3-element set, J. ACM, 53 (2006), pp. 66-120.
11. A. A. BULATOV, A. KROKHIN, and B. LAROSE, Dualities for constraint satisfaction problems, in Complexity of Constraints, Lecture Notes in Comput. Sci. 5250, Springer, Berlin, 2008, pp. 93-124.
12. A. A. BULATOV, A. A. KROKHIN, and P. JEAVONS, Constraint satisfaction problems and finite algebras, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1853, Springer, Berlin, 2000, pp. 272-282.
13. A. A. BULATOV and M. VALERIOTE, Recent results on the algebraic approach to the CSP, in Complexity of Constraints, Lecture Notes in Comput. Sci. 5250, Springer, Berlin, 2008, pp. 68-92.
14. S. N. BURRIS and H. P. SANKAPPANAVAR, A Course in Universal Algebra, Grad. Texts in Math. 78, Springer, New York, 1981.
15. C. CARVALHO, V. DALMAU, P. MARKOVIĆ, and M. MARÓTI, CD (4) has bounded width, Algebra Universalis, 60 (2009), pp. 293-307.
16. V. DALMAU, Generalized majority-minority operations are tractable, Log. Methods Comput. Sci., 2 (2006), 14 pp.
17. 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. Comput., 28 (1998), pp. 57-104.
18. P. HELL and J. NEŠETŘIL, On the complexity of H -coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
19. D. HOBBY and R. MCKENZIE, The Structure of Finite Algebras, Contemp. Math. 76, AMS, Providence, RI, 1988.
20. P. IDZIAK, P. MARKOVIĆ, R. MCKENZIE, M. VALERIOTE, and R. WILLARD, Tractability and learnability arising from algebras with few subpowers, in Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, Wroclaw, Poland, 2007, pp. 213-222.
21. P. JEAVONS, D. COHEN, and M. GYSSENS, Closure properties of constraints, J. ACM, 44 (1997), pp. 527-548.
22. B. JÓNSSON, Algebras whose congruence lattices are distributive, Math. Scand., 21 (1968), pp. 110-121.
23. E. KISS and M. VALERIOTE, On tractability and congruence distributivity, Log. Methods Com- put. Sci., 3 (2007), 20 pp.
24. B. LAROSE and L. ZÁDORI, Bounded width problems and algebras, Algebra Universalis, 56 (2007), pp. 439-466.
25. D. LESAINT, N. AZARMI, R. LAITHWAITE, and P. WALKER, Engineering dynamic scheduler for Work Manager, BT Technol. J., 16 (1998), pp. 16-29.
26. U. MONTANARI, Networks of constraints: Fundamental properties and applications to picture processing, Inform. Sci., 7 (1974), pp. 95-132.
27. B. A. NADEL, Constraint satisfaction in Prolog: Complexity and theory-based heuristics, Inf. Sci. Intell. Syst., 83 (1995), pp. 113-131.
28. B. A. NADEL and J. LIN, Automobile transmission design as a constraint satisfaction problem: Modeling the kinematic level, Artif. Intell. Eng. Des., Anal. Manuf., 5 (1991), pp. 137-171.
29. T. J. SCHAEFER, The complexity of satisfiability problems, in Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, San Diego, CA, 1978, pp. 216-226.
30. E. SCHWALB and L. VILA, Temporal constraints: A survey, Constraints, 3 (1998), pp. 129-149.
31. M. VARDI, Constraint satisfaction and database theory: A tutorial, in Proceedings of the 19th ACM Symposium on Principles of Database Systems, Dallas, 2000, pp. 76-85.
32. R. WILLARD, A finite basis theorem for residually finite, congruence meet-semidistributive varieties, J. Symbolic Logic, 65 (2000), pp. 187-200.