Random constraint satisfaction: Easy generation of hard (satisfiable) instances

Artificial Intelligence

Volumn 171, Issue 8-9, 2007, Pages 514-534

  Xu, Ke ^a   Boussemart, Frédéric ^b   Hemery, Fred ^b   Lecoutre, Christophe ^b  

^a BEIHANG UNIVERSITY   (China)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Constraint network; Hard random instances; Phase transition

Indexed keywords

ASYMPTOTIC ANALYSIS; MATHEMATICAL MODELS; NUMERICAL METHODS; PHASE TRANSITIONS; TREES (MATHEMATICS);

CONSTRAINT NETWORKS; HARD RANDOM INSTANCES; TREE-RESOLUTION COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

EID: 34249665990     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2007.04.001     Document Type: Article

References (45)

1. D. Achlioptas, C. Gomes, H. Kautz, B. Selman, Generating satisfiable problem instances, in: Proceedings of AAAI'00, 2000, pp. 256-301
2. D. Achlioptas, H. Jia, C. Moore, Hiding satisfying assignments: two are better than one, in: Proceedings of AAAI'04, 2004, pp. 131-136
3. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.S.O. Molloy, Y.C. Stamatiou, Random constraint satisfaction: a more accurate picture, in: Proceedings of CP'97, 1997, pp. 107-120
4. D. Achlioptas, C. Moore, The asymptotic order of the random k-SAT threshold, in: Proceedings of FOCS'02, 2002, pp. 779-788
5. Barthel W., Hartmann A.K., Leone M., Ricci-Tersenghi F., Weigt M., and Zecchina R. Hiding solutions in random satisfiability problems: a statistical mechanics approach. Physical Review Letters 88 18 (2002)
6. Ben-Sasson E., and Wigderson A. Short proofs are narrow-resolution made simple. Journal of the ACM 48 2 (2001) 149-169
7. C. Bessiere, J. Régin, Arc consistency for general constraint networks: preliminary results, in: Proceedings of IJCAI'97, 1997, pp. 398-404
8. Bessiere C., Régin J.C., Yap R.H.C., and Zhang Y. An optimal coarse-grained arc consistency algorithm. Artificial Intelligence 165 2 (2005) 165-185
9. F. Boussemart, F. Hemery, C. Lecoutre, L. Sais, Boosting systematic search by weighting constraints, in: Proceedings of ECAI'04, 2004, pp. 146-150
10. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: Proceedings of IJCAI'91, 1991, pp. 331-337
11. S.A. Cook, D.G. Mitchell, Finding Hard Instances of the Satisfiability Problem: A Survey, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, 1997
12. Debruyne R., and Bessiere C. Domain filtering consistencies. Journal of Artificial Intelligence Research 14 (2001) 205-230
13. O. Dubois, Y. Boufkhad, J. Mandler, Typical random 3-sat formulae and the satisfiability threshold, in: Proceedings of SODA'00, 2000, pp. 126-127
14. A.M. Frieze, M. Molloy, The satisfiability threshold for randomly generated binary constraint satisfaction problems, in: Proceedings of Random'03, 2003, pp. 275-289
15. Y. Gao, J. Culberson, Consistency and random constraint satisfaction models with a high constraint tightness, in: Proceedings of CP'04, 2004, pp. 17-31
16. Gent I.P., MacIntyre E., Prosser P., Smith B.M., and Walsh T. Random constraint satisfaction: flaws and structure. Journal of Constraints 6 4 (2001) 345-372
17. I.P. Gent, E. MacIntyre, P. Prosser, T. Walsh, The constrainedness of search, in: Proceedings of AAAI-96, 1996, pp. 246-252
18. C.P. Gomes, C. Fernández, B. Selman, C. Bessiere, Statistical regimes across constrainedness regions, in: Proceedings of CP'04, 2004, pp. 32-46
19. Haralick R.M., and Elliott G.L. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14 (1980) 263-313
20. R. Impagliazzo, L. Levin, M. Luby, Pseudo-random number generation from one-way functions, in: Proceedings of STOC'89, 1989, pp. 12-24
21. H. Jia, C. Moore, B. Selman, From spin glasses to hard satisfiable formulas, in: Proceedings of SAT'04, 2004
22. A.C. Kaporis, L.M. Kirousis, E.G. Lalas, The probabilistic analysis of a greedy satisfiability algorithm, in: Proceedings of ESA'02, 2002, pp. 574-585
23. C. Lecoutre, F. Boussemart, F. Hemery, Exploiting multidirectionality in coarse-grained arc consistency algorithms, in: Proceedings of CP'03, 2003, pp. 480-494
24. C. Lecoutre, F. Boussemart, F. Hemery, Implicit random CSPs, in: Proceedings of ICTAI'03, 2003, pp. 482-486
25. C. Lecoutre, F. Boussemart, F. Hemery, Backjump-based techniques versus conflict-directed heuristics, in: Proceedings of ICTAI'04, 2004, pp. 549-557
26. C. Lecoutre, R. Szymanek, Generalized arc consistency for positive table constraints, in: Proceedings of CP'06, 2006, pp. 284-298
27. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 1 (1977) 99-118
28. Mazure B., Sais L., and Gregoire E. Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence 22 (1998) 319-331
29. D.G. Mitchell, Some random CSPs are hard for resolution, 2000, submitted for publication
30. D.G. Mitchell, Resolution complexity of random constraints, in: Proceedings of CP'02, 2002, pp. 295-309
31. Molloy M. Models for random constraint satisfaction problems. SIAM Journal of Computing 32 4 (2003) 935-949
32. P. Morris, The breakout method for escaping from local minima, in: Proceedings of AAAI'93, 1993, pp. 40-45
33. NIST. Secure Hash Standard. National Institute of Standards and Technology (2002). http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf FIPS 180-2
34. Prosser P. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence 81 (1996) 81-109
35. R. Rivest, The MD5 message-digest algorithm, MIT Laboratory for Computer Science and RSA Data Security, Inc., 1992. Request for Comments 1321
36. D. Sabin, E. Freuder, Contradicting conventional wisdom in constraint satisfaction, in: Proceedings of CP'94, 1994, pp. 10-20
37. B. Selman, H. Kautz, Domain-independent extensions to GSAT: solving large structured satisfiability problems, in: Proceedings of IJCAI'93, 1993, pp. 290-295
38. Smith B.M. Constructing an asymptotic phase transition in random binary constraint satisfaction problems. Theoretical Computer Science 265 (2001) 265-283
39. Smith B.M., and Dyer M.E. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81 (1996) 155-181
40. J.R. Thornton, Constraint weighting local search for constraint satisfaction, PhD thesis, Griffith University, Australia, 2000
41. Williams C., and Hogg T. Exploiting the deep structure of constraint problems. Artificial Intelligence 70 (1994) 73-117
42. K. Xu, A study on the phase transitions of SAT and CSP (in Chinese), PhD thesis, Beihang University, 2000
43. K. Xu, F. Boussemart, F. Hemery, C. Lecoutre, A simple model to generate hard satisfiable instances, in: Proceedings of IJCAI'05, 2005, pp. 337-342
44. Xu K., and Li W. Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research 12 (2000) 93-103
45. Xu K., and Li W. Many hard examples in exact phase transitions with application to generating hard satisfiable instances. Technical report, CoRR Report cs.CC/0302001, Revised version in. Theoretical Computer Science 355 (2006) 291-302