Abstract
The intractability of the general CSP has motivated the search for restrictions which lead to tractable fragments. One way to achieve tractability is to restrict the structure of the instances. As much of the work in this area arises from similar work on databases it has been a natural assumption that all constraint relations are explicitly represented. If this is the case then all instances with an acyclic hypergraph structure are tractable. Unfortunately this result does not hold if we are allowed to represent constraint relations implicitly: the class of SAT instances with acyclic hypergraph structure is NP-hard.
Continuing the work of Chen and Grohe on the succinct GDNF representation we develop the theory of structural tractability for an extension to the table constraint that has a succinct representation of SAT clauses. This mixed representation is less succinct than the GDNF representation but more succinct than the table representation.
We prove a strict hierarchy of structural tractability for the GDNF, the mixed, and the explicit representations of constraint relations. Using this proof we are able to show that the mixed representation provides novel tractable structural classes. Since the mixed representation naturally extends SAT, this provides a useful result, extending known structural tractability results for SAT.
Under a natural restriction we are able precisely to capture the tractable structural classes for this mixed representation. This gives us an extension of Grohe’s dichotomy theorem for the tractability of classes of relational structures with a fixed signature. In particular it captures the tractability of some classes of unbounded arity, specifically the class of CSPs with precisely one constraint.
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.
References
Kautz, H.A., Selman, B.: Planning as satisfiability. In: Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI 1992), pp. 359–363 (1992)
van Beek, P.: Reasoning about qualitative temporal information. Artificial Intelligence 58, 297–326 (1992)
Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural CSP decomposition methods. Artif. Intell. 124(2), 243–282 (2000)
Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3), 720–742 (2005)
Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM 30, 479–513 (1983)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient sat solver. In: DAC 2001: Proceedings of the 38th conference on Design automation, pp. 530–535. ACM, New York (2001)
van Hoeve, W.J., Katriel, I.: Global constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Graham, M.: On the universal relation. Technical report, University of Toronto (1979)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Chen, H., Grohe, M.: Constraint satisfaction with succinctly specified relations. In: Creignou, N., Kolaitis, P., Vollmer, H. (eds.) Complexity of Constraints. Number 06401 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2006)
Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 188–202. Springer, Heidelberg (2004)
Houghton, C., Cohen, D., Green, M.J.: The effect of constraint representation on structural tractability. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 726–730. Springer, Heidelberg (2006)
Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54(1), 1 (2007)
Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 77–92. Springer, Heidelberg (2001)
Katsirelos, G., Bacchus, F.: Generalized NoGoods in CSPs. In: AAAI, pp. 390–396 (2005)
Katsirelos, G., Walsh, T.: A compression algorithm for large arity extensional constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 379–393. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, D.A., Green, M.J., Houghton, C. (2009). Constraint Representations and Structural Tractability. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)