On the power of structural decompositions of graph-based representations of constraint problems

Artificial Intelligence

Volumn 174, Issue 5-6, 2010, Pages 382-409

  Greco, Gianluigi ^a   Scarcello, Francesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Constraint satisfaction; Decomposition methods; Dual graphs; Hypergraphs; Incidence graphs; Primal graphs; Treewidth

Indexed keywords

CONSTRAINT SATISFACTION; DECOMPOSITION METHODS; DUAL GRAPHS; HYPER GRAPH; INCIDENCE GRAPHS; TREE-WIDTH;

ARTIFICIAL INTELLIGENCE; COMPUTER OPERATING PROCEDURES; ENCODING (SYMBOLS); GRAPH THEORY; OPERATIONS RESEARCH;

DECOMPOSITION;

EID: 76549111008     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2009.12.004     Document Type: Article

References (23)

1. Bacchus F., Chen X., van Beek P., and Walsh T. Binary vs non-binary constraints. Artificial Intelligence 140 1-2 (2002) 1-37
2. Bernstein A., and Goodman N. The power of natural semijoins. SIAM Journal on Computing 10 4 (1981) 751-771
3. Chekuri Ch., and Rajaraman A. Conjunctive query containment revisited. Theoretical Computer Science 239 2 (2000) 211-229
4. Cohen D., and Jeavons P. The complexity of constraint languages. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming (2006), Elsevier
5. Cohen D., Jeavons P., and Gyssens M. A unified theory of structural tractability for constraint satisfaction problems. Journal of Computer and System Sciences 74 5 (2008) 721-743
6. Dechter R. Constraint Networks. Encyclopedia of Artificial Intelligence. second edition (1992), Wiley and Sons pp. 276-285
7. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer, New York
8. Freuder E.C. A sufficient condition for backtrack-bounded search. Journal of the ACM 32 4 (1985) 755-761
9. Goodman N., and Shmueli O. Syntactic characterization of tree database schemas. Journal of the ACM 30 4 (1983) 767-786
10. Gottlob G., Leone N., and Scarcello F. A comparison of structural CSP decomposition methods. Artificial Intelligence 124 2 (2000) 243-282
11. Gottlob G., Leone N., and Scarcello F. Computing LOGCFL certificates. Theoretical Computer Science 270 1-2 (2002) 761-777
12. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences 64 3 (2002) 579-627
13. G. Gottlob, Z. Miklos, T. Schwentick, Generalized hypertree decompositions: NP-hardness and tractable variants, in: Proc. of the 26th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'07), 2007, pp. 13-22
14. Gottlob G., and Szeider S. Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems. The Computer Journal 51 3 (2008) 303-325
15. Gyssens M., Jeavons P.G., and Cohen D.A. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence 66 (1994) 57-89
16. Gyssens M., and Paredaens J. A decomposition methodology for cyclic databases. Advances in Database Theory vol. 2 (1984), Plenum Press, New York, NY 85-122
17. M. Grohe, D. Marx, Constraint solving via fractional edge covers, in: Proc. of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06), 2006, pp. 289-298
18. Kolaitis Ph.G., and Vardi M.Y. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61 2 (2000) 302-332
19. D. Marx, Approximating fractional hypertree width, in: Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09), 2009, pp. 902-911
20. Robertson N., and Seymour P.D. Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms 7 (1986) 309-322
21. Samer M., and Szeider S. Constraint satisfaction with bounded treewidth revisited. Journal of Computer and System Sciences 76 2 (2010) 103-114
22. Scarcello F., Gottlob G., and Greco G. Uniform constraint satisfaction problems and database theory. Complexity of Constraints. LNCS vol. 5250 (2008), Springer 156-195
23. R. Seidel, A new method for solving constraint satisfaction problems, in: Proc. of the 7th International Joint Conference on Artificial Intelligence (IJCAI'81), 1981, pp. 338-342