Abstract
A constraint satisfaction problem (CSP) instance has a set of variables, each of which can take values in some domain. It also has a set of constraints, each of which restricts the variables in its scope to take values limited by its constraint relation.
The language of a constraint satisfaction problem instance is the set of different constraint relations used in its specification. For a given set of relations Γ over some domain we define the problem CSP (Γ) to the set of CSP instances whose language is contained in Γ.
The decision problem for a set of CSP instances is, given an instance in the class, to decide whether a solution exists. The search problem is to find such a solution. Here we address the connection between the tractability of the decision and search problems. We prove that given a constraint language Γ over a finite domain for which the decision problem for CSP (Γ) is tractable, the search problem is always tractable.
We define a surjective language over a finite domain in a standard way. We also show that we can determine in polynomial time whether an instance over a surjective language with a tractable decision problem has fewer than k solutions, and that we can generate all of its solutions with polynomial delay.
Similar content being viewed by others
References
Bulatov, A., & Dalmau, V. (2003). Towards a dichotomy theorem for the counting constraint satisfaction problem. Submitted to FOCS-03.
Cohen, D., Jeavons, P., & Gault, R. (2003). New tractable constraint classes from old. In Lakemeyer, G., & Nebel, B., eds., Exploring Artificial Intelligence in the New Millenium, pages 331–354. Morgan Kaufman.
Cohen, D., Jeavons, P., Jonsson, P., & Koubarakis, M. (2000). Building tractable disjunctive constraints. Journal of the ACM, 47: 826–853.
Creignou, N., & Hébrard, M. (1997). On generating all solutions of generalized satisfiability problems. Theoretical Informatics and Applications, 31(6): 499–511.
Dechter, R., & Itai, A. (1992). Finding all solutions if you can find one. In Presented in the Workshop on Tractable Reasoning, AAAI-92, pages 35–39. San Jose, CA, USA.
Dechter, R., & Pearl, J. (1992). Structural identification in relational data. Artificial Intelligence, 58: 237–270.
Jeavons, P. (1998). On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200: 185–204.
Jeavons, P., Cohen, D., & Cooper, M. (1998). Constraints, consistency and closure. Artificial Intelligence, 101(1-2): 251–265.
Jeavons, P., Cohen D., & Gyssens, M. (1996). A test for tractability. In Proceedings 2nd International Conference on Constraints Programming-CP'96 (Boston, August 1996), Vol. 1118 of Lecture Notes in Computer Science, pages 267–281, Springer-Verlag.
Jeavons, P., Cohen, D., & Gyssens, M. (1997). Closure properties of constraints. Journal of the ACM, 44: 527–548.
Jeavons, P., & Cooper M. (1995). Tractable constraints on ordered domains. Artificial Intelligence, 79(2): 327–339.
Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7: 95–132.
Papadimitriou, C. (1994). Computational Complexity. Addison-Wesley.
Valiant, L. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3): 420–421.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cohen, D.A. Tractable Decision for a Constraint Language Implies Tractable Search. Constraints 9, 219–229 (2004). https://doi.org/10.1023/B:CONS.0000036045.82829.94
Issue Date:
DOI: https://doi.org/10.1023/B:CONS.0000036045.82829.94