On the power of structural decompositions of graph-based representations of constraint problems
暂无分享,去创建一个
[1] Phokion G. Kolaitis,et al. Conjunctive-query containment and constraint satisfaction , 1998, PODS.
[2] Martin Grohe,et al. Constraint solving via fractional edge covers , 2006, SODA 2006.
[3] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[4] Philip A. Bernstein,et al. Power of Natural Semijoins , 1981, SIAM J. Comput..
[5] Toby Walsh,et al. Binary vs. non-binary constraints , 2002, Artif. Intell..
[6] Marc Gyssens,et al. Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..
[7] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.
[8] Georg Gottlob,et al. Computing LOGCFL certificates , 1999, Theor. Comput. Sci..
[9] Stuart C. Shapiro,et al. Encyclopedia of artificial intelligence, vols. 1 and 2 (2nd ed.) , 1992 .
[10] Anand Rajaraman,et al. Conjunctive query containment revisited , 2000, Theor. Comput. Sci..
[11] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.
[12] Georg Gottlob,et al. Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems , 2007, Comput. J..
[13] Peter Jeavons,et al. The Complexity of Constraint Languages , 2006, Handbook of Constraint Programming.
[14] Marc Gyssens,et al. A Decomposition Methodology for Cyclic Databases , 1982, Advances in Data Base Theory.
[15] Marc Gyssens,et al. A unified theory of structural tractability for constraint satisfaction problems , 2008, J. Comput. Syst. Sci..
[16] Dániel Marx,et al. Approximating fractional hypertree width , 2009, TALG.
[17] Nathan Goodman,et al. Syntactic Characterization of Tree Database Schemas , 1983, JACM.
[18] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[19] Georg Gottlob,et al. Uniform Constraint Satisfaction Problems and Database Theory , 2008, Complexity of Constraints.
[20] Thomas Schwentick,et al. Generalized hypertree decompositions: np-hardness and tractable variants , 2007, PODS '07.
[21] Raimund Seidel,et al. A New Method for Solving Constraint Satisfaction Problems , 1981, IJCAI.
[22] Marko Samer,et al. Constraint satisfaction with bounded treewidth revisited , 2010, J. Comput. Syst. Sci..
[23] Eugene C. Freuder. A sufficient condition for backtrack-bounded search , 1985, JACM.