Constraint satisfaction with bounded tree width revisited

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

Volumn 4204 LNCS, Issue , 2006, Pages 499-513

  Samer, Marko ^a   Szeider, Stefan ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

CONSTRAINT SATISFACTION; DUAL GRAPHS; POLYNOMIAL TIME; TIME COMPLEXITIES;

CONSTRAINT THEORY;

EID: 33750331505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_36     Document Type: Conference Paper

References (22)

1. H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
2. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
3. H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms.
4. H. Chen and V. Dalmau. Beyond hypertree width: Decomposition methods without decompositions. In Proc. CP'05, LNCS, vol. 3709, 167-181. Springer, 2005.
5. D. Cohen and P. Jeavons. The complexity of constraint languages. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, part I, chapter 8. Elsevier, 2006 (forthcoming).
6. D. Cohen, P. Jeavons, and M. Gyssens. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In Proc. IJCAI'05, 72-77, 2005.
7. R. Dechter. Tractable structures for constraint satisfaction problems. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, part I, chapter 7. Elsevier, 2006 (forthcoming).
8. R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38(3):353-366, 1989.
9. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
10. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
11. E. C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(4):755-761, 1985.
12. T. Ganzow, G. Gottlob, N. Musliu, and M. Samer. A CSP hypergraph library. Technical Report DBAI-TR-2005-50, Database and Artificial Intelligence Group, Vienna University of Technology, 2005.
13. G. Gottlob, M. Grohe, N. Musliu, M. Samer, and F. Scarcello. Hypertree decompositions: Structure, algorithms, and applications. In D. Kratsch, editor, Proc. WG'05, LNCS, vol. 3787, 1-15. Springer, 2005.
14. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions: a survey. In Proc. MFCS'01, LNCS, vol. 2136, 37-57. Springer, 2001.
15. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. J. of Computer and System Sciences, 64(3):579-627, 2002.
16. G. Gottlob, F. Scarcello, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 138(1-2):55-86, 2002.
17. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In Proc. SODA '06, 289-298, ACM, 2006.
18. P. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. J. of Computer and System Sciences, 61(2):302-332, 2000.
19. R. Niedermeier. Invitation to Fixed-Pammeter Algorithms. Oxford University Press, 2006.
20. C. H. Papadimitriou and M. Yannakakis. On the complexity of database queries. J. of Computer and System Sciences, 58(3):407-427, 1999.
21. B. Reed. Finding approximate separators and computing tree width quickly. In Proc. STOC'92, 221-228. ACM, 1992.
22. S. Szeider. On fixed-parameter tractable parameterizations of SAT. In E. Giunchiglia and A. Tacchella, editors, Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers, LNCS, vol. 2919, 188-202. Springer, 2004.