The dichotomy for conservative constraint satisfaction problems revisited

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2011, Pages 301-310

  Barto, Libor ^a,b  

^a MCMASTER UNIVERSITY   (Canada)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Conservative algebra; Constraint satisfaction problem; Dichotomy theorem; List homomorphism problem

Indexed keywords

CONSERVATIVE ALGEBRA; CONSTRAINT LANGUAGE; CONSTRAINT SATISFACTION PROBLEMS; DICHOTOMY THEOREM; LIST-HOMOMORPHISMS; NP COMPLETE; OVER-CONSTRAINT; UNARY RELATIONS;

COMPUTER SCIENCE;

THEOREM PROVING;

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

References (26)

1. 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., vol. 28, no. 1, pp. 57-104 (electronic), 1999. [Online]. Available: http://dx.doi.org/10.1137/S0097539794266766 (Pubitemid 128491791)
2. P. Jeavons, D. Cohen, and M. Gyssens, "Closure properties of constraints," J. ACM, vol. 44, no. 4, pp. 527-548, 1997. [Online]. Available: http://dx.doi.org/10.1145/263867.263489 (Pubitemid 127617702)
3. A. A. Bulatov, A. A. Krokhin, and P. Jeavons, "Constraint satisfaction problems and finite algebras," in Automata, languages and programming (Geneva, 2000), ser. Lecture Notes in Comput. Sci. Berlin: Springer, 2000, vol. 1853, pp. 272-282.
4. A. Bulatov, P. Jeavons, and A. Krokhin, "Classifying the complexity of constraints using finite algebras," SIAM J. Comput., vol. 34, no. 3, pp. 720-742 (electronic), 2005. [Online]. Available: http://dx.doi.org/10.1137/ S0097539700376676 (Pubitemid 40844240)
5. A. Bulatov, "Mal'tsev constraints are tractable," Computing Laboratory, University of Oxford, Oxford, UK, Tech. Rep. PRG-RR-02-05, 2002.
6. A. Bulatov and V. Dalmau, "A simple algorithm for Mal'tsev constraints," SIAM J. Comput., vol. 36, no. 1, pp. 16-27 (electronic), 2006. [Online]. Available: http://dx.doi.org/10.1137/050628957 (Pubitemid 46374016)
7. V. Dalmau, "Generalized majority-minority operations are tractable," Log. Methods Comput. Sci., vol. 2, no. 4, pp. 4:1, 14, 2006.
8. P. M. Idziak, P. Markovic, R. McKenzie, M. Valeriote, and R. Willard, "Tractability and learnability arising from algebras with few subpowers," in LICS. IEEE Computer Society, 2007, pp. 213-224.
9. L. Barto and M. Kozik, "Constraint satisfaction problems of bounded width," in FOCS'09: Proceedings of the 50th Symposium on Foundations of Computer Science, 2009, pp. 595-603.
10. -, "Constraint satisfaction problems solvable by local consistency methods," in preparation.
11. A. A. Bulatov, "A dichotomy theorem for constraint satisfaction problems on a 3-element set," J. ACM, vol. 53, no. 1, pp. 66-120 (electronic), 2006. [Online]. Available: http://dx.doi.org/10.1145/1120582. 1120584
12. T. J. Schaefer, "The complexity of satisfiability problems," in Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978). New York: ACM, 1978, pp. 216-226.
13. A. A. Bulatov, "Tractable conservative constraint satisfaction problems," Logic in Computer Science, Symposium on, vol. 0, p. 321, 2003.
14. L. Barto, M. Kozik, and T. Niven, "Graphs, polymorphisms and the complexity of homomorphism problems," in STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 2008, pp. 789-796.
15. -, "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., vol. 38, no. 5, pp. 1782-1802, 2008/09. [Online]. Available: http://dx.doi.org/10.1137/070708093
16. L. Barto and M. Kozik, "Congruence distributivity implies bounded width," SIAM Journal on Computing, vol. 39, no. 4, pp. 1531-1542, 2009. [Online]. Available: http://link.aip.org/link/?SMJ/39/1531/1
17. -, "New conditions for Taylor varieties and CSP," Logic in Computer Science, Symposium on, vol. 0, pp. 100-109, 2010.
18. -, "Absorbing subalgebras, cyclic terms and the constraint satisfaction problem," submitted.
19. T. Feder, P. Hell, and J. Huang, "List homomorphisms and circular arc graphs," Combinatorica, vol. 19, pp. 487-505, 1999.
20. -, "Bi-arc graphs and the complexity of list homomorphisms," J. Graph Theory, vol. 42, pp. 61-80, January 2003. [Online]. Available: http://portal.acm.org/citation.cfm?id=1380681.1380685
21. P. Hell and A. Rafiey, "The dichotomy of list homomorphisms for digraphs," CoRR, vol. abs/1004.2908, 2010.
22. L. Egri, A. Krokhin, B. Larose, and P. Tesson, "The complexity of the list homomorphism problem for graphs," in 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), ser. Leibniz International Proceedings in Informatics (LIPIcs), J.-Y. Marion and T. Schwentick, Eds., vol. 5. Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2010, pp. 335-346. [Online]. Available: http://drops.dagstuhl. de/opus/volltexte/2010/2467
23. R. Takhanov, "A dichotomy theorem for the general minimum cost homomorphism problem," in 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), ser. Leibniz International Proceedings in Informatics (LIPIcs), J.-Y. Marion and T. Schwentick, Eds., vol. 5. Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2010, pp. 657-668. [Online]. Available: http://drops.dagstuhl.de/opus/volltexte/2010/2493
24. V. Kolmogorov and S. Zivny, "The complexity of conservative finite-valued csps," CoRR, vol. abs/1008.1555, 2010.
25. M. Maróti and R. McKenzie, "Existence theorems for weakly symmetric operations," Algebra Universalis, vol. 59, no. 3-4, pp. 463-489, 2008. [Online]. Available: http://dx.doi.org/10.1007/s00012-008-2122-9
26. M. Maróti, "Tree on top of maltsev," preprint.