Constraint satisfaction with bounded treewidth revisited

Journal of Computer and System Sciences

Volumn 76, Issue 2, 2010, Pages 103-114

  Samer, Marko ^a   Szeider, Stefan ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Constraint satisfaction; Parameterized complexity; Treewidth

Indexed keywords

COMPUTER NETWORKS; SYSTEMS SCIENCE;

BASIC PARAMETERS; BOUNDED TREEWIDTH; CONSTRAINT SATISFACTION; FIXED-PARAMETER TRACTABILITY; INCIDENCE GRAPHS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; TREE-WIDTH;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 70450224275     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2009.04.003     Document Type: Article

References (28)

1. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley
2. Bodlaender H.L. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 6 (1996) 1305-1317
3. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 1-2 (1998) 1-45
4. Bodlaender H.L., and Kloks T. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21 2 (1996) 358-402
5. Chen H., and Dalmau V. Beyond hypertree width: Decomposition methods without decompositions. Proc. 11th International Conference on Principles and Practice of Constraint Programming. CP'05. Lecture Notes in Comput. Sci. vol. 3709 (2005), Springer-Verlag 167-181
6. Cohen D., and Jeavons P. The complexity of constraint languages. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming, Part 1 (2006), Elsevier 245-280 (Chapter 8)
7. Cohen D., Jeavons P., and Gyssens M. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. Proc. 19th International Joint Conference on Artificial Intelligence. IJCAI'05 (2005), Professional Book Center 72-77
8. Dechter R. Tractable structures for constraint satisfaction problems. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming, Part 1 (2006), Elsevier 209-244 (Chapter 7)
9. Dechter R., and Pearl J. Tree clustering for constraint networks. Artificial Intelligence 38 3 (1989) 353-366
10. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag
11. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer-Verlag
12. Freuder E.C. A sufficient condition for backtrack-bounded search. J. ACM 32 4 (1985) 755-761
13. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 3 (1976) 237-267
14. Gottlob G., Grohe M., Musliu N., Samer M., and Scarcello F. Hypertree decompositions: Structure, algorithms, and applications. Proc. 31st International Workshop on Graph-Theoretic Concepts in Computer Science. WG'05. Lecture Notes in Comput. Sci. vol. 3787 (2005), Springer-Verlag 1-15
15. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions: A survey. Proc. 26th International Symposium on Mathematical Foundations of Computer Science. MFCS'01. Lecture Notes in Comput. Sci. vol. 2136 (2001), Springer-Verlag 37-57
16. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions and tractable queries. J. Comput. System Sci. 64 3 (2002) 579-627
17. Gottlob G., Scarcello F., and Sideri M. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence 138 1-2 (2002) 55-86
18. Grohe M., and Marx D. Constraint solving via fractional edge covers. Proc. 17th ACM-SIAM Symposium on Discrete Algorithms. SODA'06 (2006), ACM Press 289-298
19. Impagliazzo R., Paturi R., and Zane F. Which problems have strongly exponential complexity?. J. Comput. System Sci. 63 4 (2001) 512-530
20. Kolaitis P.G., and Vardi M.Y. Conjunctive-query containment and constraint satisfaction. J. Comput. System Sci. 61 2 (2000) 302-332
21. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
22. Papadimitriou C.H., and Yannakakis M. On the complexity of database queries. J. Comput. System Sci. 58 3 (1999) 407-427
23. Reed B. Finding approximate separators and computing tree width quickly. Proc. 24th ACM Symposium on Theory of Computing. STOC'92 (1992), ACM Press 221-228
24. Samer M., and Szeider S. Constraint satisfaction with bounded treewidth revisited. Proc. 12th International Conference on Principles and Practice of Constraint Programming. CP'06. Lecture Notes in Comput. Sci. vol. 4204 (2006), Springer-Verlag 499-513
25. Samer M., and Szeider S. Algorithms for propositional model counting. Proc. 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR'07. Lecture Notes in Comput. Sci. vol. 4790 (2007), Springer-Verlag 484-498
26. Samer M., and Szeider S. Fixed-parameter tractability. In: Biere A., Heule M., van Maaren H., and Walsh T. (Eds). Handbook of Satisfiability, Part 1: Theory and Algorithms. Frontiers Artificial Intelligence Appl. vol. 185 (2009), IOS Press 425-454 (Chapter 13)
27. Szeider S. On fixed-parameter tractable parameterizations of SAT. Proc. 6th International Conference on Theory and Applications of Satisfiability, Selected and Revised Papers. SAT'03. Lecture Notes in Comput. Sci. vol. 2919 (2004), Springer-Verlag 188-202
28. Yannakakis M. Algorithms for acyclic database schemes. Proc. 7th International Conference on Very Large Data Bases. VLDB'81 (1981), IEEE Computer Society 82-94