Abstract
The Minimal Constraint Satisfaction Problem, or Minimal CSP for short, arises in a number of real-world applications, most notably in constraint-based product configuration. Despite its very permissive structure, it is NP-hard, even when bounding the size of the domains by \(d\ge 9\). Yet very little is known about the Minimal CSP beyond that. Our contribution through this paper is twofold. Firstly, we generalize the complexity result to any value of d. We prove that the Minimal CSP remains NP-hard for \(d\ge 3\), as well as for \(d=2\) if the arity k of the instances is strictly greater than 2. Our complexity result can be seen as providing a dichotomy theorem for the Minimal CSP. Secondly, we build a generator that can create Minimal CSP instances of any size, using the constrainedness as a parameter. Our generator can be used to study behaviors that are typical of NP-hard problems, such as the presence of a phase transition, in the case of the Minimal CSP.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We are aware that finding a solution to a Minimal CSP is both a search problem (find a solution) and a promise problem (the input CSP is satisfiable because it is minimal), rather that a decision problem. However, we use this terminology in the same manner as Gottlob [6], where a thorough discussion of the matter can be found.
- 2.
Our experiments are run under CentOS 6.6, on two Intel processors (1.33 Ghz each), and with 12 GB of DDR2 FB-DIMM RAM.
References
Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: Kautz, H.A., Porter, B.W. (eds.) Proceedings of AAAI, pp. 256–261. AAAI Press/The MIT Press (2000)
Amilhastre, J., Fargier, H., Marquis, P.: Consistency restoration and explanations in dynamic csps application to configuration. Artif. Intell. 135(1–2), 199–234 (2002)
Clark, D.A., Frank, J., Gent, I.P., MacIntyre, E., Tomov, N., Walsh, T.: Local search and the number of solutions. In: Freuder, Eugene C. (ed.) CP 1996. LNCS, vol. 1118. Springer, Heidelberg (1996)
Freuder, E.C.: A sufficient condition for backtrack-bounded search. J. ACM 32(4), 755–761 (1985)
Gent, I.P., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Clancey, W.J., Weld, D.S. (eds.) Proceedings of AAAI, pp. 246–252. AAAI Press/The MIT Press (1996)
Gottlob, G.: On minimal constraint networks. Artif. Intell. 191–192, 42–60 (2012)
Hogg, T., Huberman, B.A., Williams, C.P.: Phase transitions and the search problem. Artif. Intell. 81(1–2), 1–15 (1996)
Junker, U.: Configuration. In: Handbook of Constraint Programming. Foundations of Artificial Intelligence, pp. 837–873. Elsevier (2006)
Schaefer, T.J.: The complexity of satisfiability problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1–3 May 1978, San Diego, pp. 216–226. ACM (1978)
Xu, K., Li, W.: Exact phase transitions in random constraint satisfaction problems. J. Artif. Intell. Res. (JAIR) 12, 93–103 (2000)
Xu, K., Li, W.: Many hard examples in exact phase transitions. Theor. Comput. Sci. 355(3), 291–302 (2006)
This publication has emanated from research conducted with the financial support of Science Foundation Ireland (SFI) under Grant Number SFI/12/RC/2289.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Escamocher, G., O’Sullivan, B. (2015). On the Minimal Constraint Satisfaction Problem: Complexity and Generation. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_54
Download citation
DOI: https://doi.org/10.1007/978-3-319-26626-8_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26625-1
Online ISBN: 978-3-319-26626-8
eBook Packages: Computer ScienceComputer Science (R0)