The structure of tractable constraint satisfaction problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4162 LNCS, Issue , 2006, Pages 58-72

  Grohe, Martin ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; PROBLEM SOLVING;

CONSTRAINT SATISFACTION; STRUCTURAL RESTRICTIONS;

CONSTRAINT THEORY;

EID: 33750091302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_5     Document Type: Conference Paper

References (30)

1. I. Adler, G. Gottlob, and M. Grohe. Hypertree-width and related hypergraph invariants. In S. Felsner, editor, Proceedings of the 3rd European Conference on Combinatorics, Graph Theory, and Applications, volume AE of DMTCS Proceedings Series, pages 5-10, 2005.
2. S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic Discrete Methods, 8:277-284, 1987.
3. H.L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25:1305-1317, 1996.
4. A. Bulatov. Tractable conservative constraint satisfaction problems. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science, pages 321-330, 2003.
5. A. Bulatov. H-coloring dichotomy revisited. Theoretical Computer Science, 349:31-39, 2005.
6. A. Bulatov. A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM, 53:66-120, 2006.
7. A. Bulatov, A. Krokhin, and P. Jeavons. The complexity of maximal constraint languages. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 667-674, 2001.
8. A. Bulatov, A. Krokhin, and P. Jeavons. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing, 34:720-742, 2005.
9. H. Chen and V. Dalmau. Beyond hypertree width: Decomposition methods without decompositions. In P. van Beek, editor, Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, volume 3709 of Lecture Notes in Computer Science, pages 167-181. Springer-Verlag, 2005.
10. H. Chen and M. Grohe. Constraint satisfaction with succinctly specified relations. In preparation.
11. D. Cohen and P. Jeavons. The complexity of constraint languages. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 6. Elsevier, 2006.
12. D. Cohen, P. Jeavons, and M. Gyssens. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, 2005. To appear.
13. V. Dalmau. Generalized majority-minority operations are tractable. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science, pages 438-447, 2005.
14. V. Dalmau, Ph. G. Kolaitis, and M. Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In P. Van Hentenryck, editor, Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, volume 2470 of Lecture Notes in Computer Science, pages 310-326. Springer-Verlag, 2002.
15. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
16. 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.
17. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, 2006.
18. E.C. Freuder. Complexity of k-tree structured constraint satisfaction problems. In Proceedings of the 8th National Conference on Artificial Intelligence, pages 4-9, 1990.
19. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64:579-627, 2002.
20. M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 552-561, 2003.
21. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In Proceedings of the of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 289-298, 2006.
22. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B, 48:92-110, 1990.
23. P. Hell, J. Nešetřil, and X. Zhu. Complexity of tree homomorphisms. Discrete Applied Mathematics, 70:23-36, 1996.
24. P. Hell, J. Nešetřil, and X. Zhu. Duality and polynomial testing of tree homomorphisms. Transactions of the American Mathematical Society, 348(4):1281-1297, 1996.
25. P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
26. P. Jeavons, D. A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-548, 1997.
27. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. In Proceedings of the 17th ACM Symposium on Principles of Database Systems, pages 205-213, 1998.
28. R.E. Ladner. On the structure of polynomial time reducibility. Journal of the ACM, 22:155-171, 1975.
29. T.J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 216-226, 1978.
30. V.V. Vazirani. Approximation Algorithms. Springer-Verlag, 2004.