Abstract
The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a computation problem where the focus is either on finding one solution, or on enumerating all solutions, possibly projected over some given set of output variables. The paper investigates the structural tractability of the problem of enumerating (possibly projected) solutions, where tractability means here computable with polynomial delay (WPD), since in general exponentially many solutions may be computed. A general framework based on the notion of tree projection of hypergraphs is considered, which generalizes all known decomposition methods. Tractability results have been obtained both for classes of structures where output variables are part of their specification, and for classes of structures where computability WPD must be ensured for any possible set of output variables. These results are shown to be tight, by exhibiting dichotomies for classes of structures having bounded arity and where the tree decomposition method is considered.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adler, I.: Tree-Related Widths of Graphs and Hypergraphs. SIAM Journal Discrete Mathematics 22(1), 102–123 (2008)
Atserias, A., Bulatov, A., Dalmau, V.: On the Power of k-Consistency. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 279–290. Springer, Heidelberg (2007)
Bernstein, P.A., Goodman, N.: The power of natural semijoins. SIAM Journal on Computing 10(4), 751–771 (1981)
Bulatov, A., Dalmau, V., Grohe, M., Marx, D.: Enumerating Homomorphism. In: Proc. of STACS 2009, pp. 231–242 (2009)
Chen, H., Dalmau, V.: Beyond Hypertree Width: Decomposition Methods Without Decompositions. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 167–181. Springer, Heidelberg (2005)
Cohen, D.A.: Tractable Decision for a Constraint Language Implies Tractable Search. Constraints 9(3), 219–229 (2004)
Cohen, D., Jeavons, P., Gyssens, M.: A unified theory of structural tractability for constraint satisfaction problems. Journal of Computer and System Sciences 74(5), 721–743 (2008)
Dechter, R., Itai, A.: Finding All Solutions if You can Find One. In: AAAI 1992 Workshop on Tractable Reasoning, pp. 35–39 (1992)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
Goodman, N., Shmueli, O.: The tree projection theorem and relational query processing. Journal of Computer and System Sciences 29(3), 767–786 (1984)
Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124(2), 243–282 (2000)
Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. Journal of Computer and System Sciences 64(3), 579–627 (2002)
Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. of Computer and System Sciences 66(4), 775–808 (2003)
Gottlob, G., Miklós, Z., Schwentick, T.: Generalized hypertree decompositions: NP-hardness and tractable variants. Journal of the ACM 56(6) (2009)
Greco, G., Scarcello, F.: The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability. In: Proc. of PODS 2010, pp. 327–338 (2010)
Grohe, M., Schwentick, T., Segoufin, L.: When is the evaluation of conjunctive queries tractable? In: Proc. of STOC 2001, pp. 657–666 (2001)
Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54(1) (2007)
Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proc. of SODA 2006, pp. 289–298 (2006)
Marx, D.: Approximating fractional hypertree width. In: Proc. of SODA 2009, pp. 902–911 (2008)
Marx, D.: Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries. In: Proc. of STOC 2010, pp. 735–744 (2010)
Robertson, N., Seymour, P.D.: Graph minors III: Planar tree-width. Journal of Combinatorial Theory, Series B 36, 49–64 (1984)
Robertson, N., Seymour, P.D.: Graph minors V: Excluding a planar graph. Journal of Combinatorial Theory, Series B 41, 92–114 (1986)
Sagiv, Y., Shmueli, O.: O Shmueli. Solving Queries by Tree Projections. ACM Transaction on Database Systems 18(3), 487–511 (1993)
Scarcello, F., Gottlob, G., Greco, G.: Uniform Constraint Satisfaction Problems and Database Theory. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 156–195. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greco, G., Scarcello, F. (2010). Structural Tractability of Enumerating CSP Solutions. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-15396-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15395-2
Online ISBN: 978-3-642-15396-9
eBook Packages: Computer ScienceComputer Science (R0)