Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances

K. Xu, F. Boussemart, F. Hemery and C. Lecoutre. Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances. Artificial Intelligence, 171(2007):514-534. Earlier version appeared in Proc. of 19th IJCAI, pp.337-342, Scotland, 2005.

Abstract: In this paper, we try to further demonstrate that the models of random CSP instances proposed by Xu and Li are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features. First, it is quite easy to generate random instances of any arity since no particular structure has to be integrated, or property enforced, in such instances. Then, the existence of an asymptotic phase transition can be guaranteed while applying a limited restriction on domain size and on constraint tightness. In that case, a threshold point can be precisely located and all instances have the guarantee to be hard at the threshold, i.e., to have an exponential tree-resolution complexity. Next, a formal analysis shows that it is possible to generate forced satisfiable instances whose hardness is similar to unforced satisfiable ones. This analysis is supported by some representative results taken from an intensive experimentation that we have carried out, using complete and incomplete search methods.
Keywords: CSP, SAT, constraint satisfaction, phase transition, sharp thresholds, resolution complexity, computational complexity, hard satisfiable instances, satisfiable problems generation.

Related Paper:
Exact Phase Transitions in Random Constraint Satisfaction Problems, JAIR, 2000.
Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances.

Forced Satisfiable CSP and SAT benchmarks of Model RB
Benchmarks with Hidden Optimum Solutions for Independent Set, Vertex Cover, Clique and Vertex Coloring
Pseudo-Boolean (0-1 Integer Programming) Benchmarks with Hidden Optimum Solutions

Back to Ke Xu's homepage.