A comparison of structural CSP decomposition methods

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 394-399

  Gottlob, Georg ^a   Leone, Nicola ^a   Scarcello, Francesco ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA BASE THEORY; DECOMPOSITION METHODS; HYPERTREE DECOMPOSITION; NON-BINARY; TRACTABLE CLASS;

ARTIFICIAL INTELLIGENCE;

EID: 0003000434     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs. J. of Algorithms, 12:308-340, 1991.
2. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30(3):479-513, July, 1983.
3. RA. Bernstein, and N. Goodman. The power of natural semijoins. SI AM Journal on Computing, 10(4):751-771, 1981.
4. W. Bibel. Constraint Satisfaction from a Deductive Viewpoint. AIJ, 35, 401-413, 1988.
5. H.L. Bodlaender. Treewidth: Algorithmic Techniques and Results. In Proc. of MFCS'97, Bratislava. LNCS 1295, Springer, pp. 19-36, 1997.
6. R. Dechter. Constraint Networks. In Encyclopedia of AI, 2nd ed., Wiley and Sons, pp. 276-285,1992.
7. R. Dechter and J. Pearl. Network based heuristics for CSPs. AIJ, 34(1):1-38, 1988.
8. R. Dechter and J. Pearl. Tree clustering for constraint networks. AIJ, 38:353-366, 1989.
9. E.G. Freuder. A sufficient condition for backtrack-free search. J ACM, 29(1):24-32, 1982.
10. E.G. Freuder. A sufficient condition for backtrack-bounded search. J ACM, 32(4):755 761, 1985.
11. E.C. Freuder. Complexity of K-Tree Structured CSPs. Proc. of AAAI'90, 1990.
12. MR. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman and Comp., NY, USA, 1979.
13. G. Gottlob, N. Leone, and F. Scarcello. The Complexity of Acyclic Conjunctive Queries, in Proc. of FOCS'98, pp.706-715, Palo Alto, CA, 1998.
14. G. Gottlob, N. Leone, and F. Scarcello. "Hypertree Decompositions and Tractable Queries," in Proc of PODS'99, Philadelphia, May, 1999.
15. G. Gottlob, N. Leone, and F. Scarcello. "A Comparison of Structural CSP Decomposition Methods," Tech. Rep. DBAI-TR-99/25, currently available on the web as: www.dbai.tuwien.ac.at/staff/gottlob/CSP-decomp.ps
16. M. Gyssens, P. Jeavons, and D. Cohen. Decomposing constraint satisfaction problems using database techniques. AIJ, 66:57-89, 1994.
17. M. Gyssens and J. Paredaens. A Decomposition Methodology for Cyclic Databases. In Advances in Database Theory, volume 2, pp. 85-122. Plenum Press New York, NY, 1984.
18. P. Jeavons, D. Cohen, and M. Gyssens. Closure Properties of Constraints. J ACM, 44(4), 1997.
19. D. Maier, The theory of relational databases. Computer Science Press, Rockville, MD, 1986.
20. J. Pearson and P.G. Jeavons. A Survey of Tractable Constraint Satisfaction Problems, CSD-TR-97-15, Royal Holloway Univ. of London, 1997.
21. N. Robertson and P.D. Seymour. Graph Minors II. Algorithmic aspects of tree width. Journal of Algorithms, 7:309-322, 1986.
22. R. Seidel. A new method for solving constraint satisfaction problems. In Proc. of IJCAI'81, 1981.