Constraint solving via fractional edge covers

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 289-298

  Grohe, Martin ^a   Marx, Dániel ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL MODELS; POLYNOMIALS; TIME SERIES ANALYSIS; TREES (MATHEMATICS);

CONSTRAINT SOLVING; EMBEDDING PROBLEMS; HYPERTREES;

PROBLEM SOLVING;

EID: 33244484086     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109590     Document Type: Conference Paper

References (30)

1. I. Adler. Marshals, monotone marshals, and hypertree-width. Journal of Graph Theory, 47:275-296, 2004.
2. I. Adler, G. Gottlob, and M. Grohe. Hypertree-width and related hypergraph invariants. In Proceedings of the 3rd European Conference on Combinatorics, Graph Theory, and Applications, 2005. To appear.
3. N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42:844-856, 1995.
4. C. Berge. Graphs and Hypergraphs. North Holland, 1976.
5. A. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 649-658, 2002.
6. A. A. Bulatov. Tractable conservative constraint satisfaction problems. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science, pages 321-330, 2003.
7. A. A. Bulatov, A. 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. H. Chen and V. Dalmau. Beyond hypertree width: Decomposition methods without decompositions. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, 2005. To appear.
9. F. Chung, P. Frank, R. Graham, and J. Shearer. Some intersection theorems for ordered sets and graphs. Journal of Combinatorial Theory, Series A, 43:23-37, 1986.
10. D. Cohen, P. Jeavons, and M. Gysseris. 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.
11. 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.
12. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
13. R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38:353-366, 1989.
14. R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM, 30(3):514-550, 1983.
15. 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.
16. 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.
17. E. Friedgut and J. Kahn. On the number of copies of a hypergraph in another. Israel Journal of Mathematics, 105:251-256, 1998.
18. G. Gottlob, M. Grohe, N. Musliu, M. Samer, and F. Scarcello. Hypertree decompositions: Structure, algorithms, and applications. In Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, 2005. To appear.
19. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. In T. Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 394-399. Morgan Kaufmann, 1999.
20. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64:579-627, 2002.
21. G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences, 66:775-808, 2003.
22. 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.
23. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 657-666, 2001.
24. P. Jeavons, D. A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-548, 1997.
25. 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.
26. D. Marx. The closest substring problem with small distances. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005. To appear.
27. B. Reed. Tree width and tangles: A new connectivity measure and some applications. In R.A. Bailey, editor, Surveys in Combinatorics, volume 241 of LMS Lecture Note Series, pages 87-162. Cambridge University Press, 1997.
28. T.J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 216-226, 1978.
29. P.D. Seymour and R. Thomas. Graph searching and a minmax theorem for tree-width. Journal of Combinatorial Theory, Series B, 58:22-33, 1993.
30. M. Yannakakis. Algorithms for acyclic database schemes. In 7th International Conference on Very Large Data Bases, pages 82-94, 1981.