Generating hard satisfiable formulas by hiding solutions deceptively

Journal of Artificial Intelligence Research

Volumn 28, Issue , 2007, Pages 107-118

  Jia, Haixia ^a   Moore, Cristopher ^a   Strain, Doug ^a  

^a University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CONSTRAINT THEORY; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

CONSTRAINT SATISFACTION; PROBABILITY PROPORTIONALS; SEARCH ALGORITHMS;

ALGORITHMS;

EID: 34249014095     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2039     Document Type: Article

References (23)

1. Achlioptas, D., Beame, P., &: Molloy, M. (2001). A sharp threshold in proof complexity. In Proc. STOC, pp. 337-346.
2. Achlioptas, D., Gomes, C., Kautz, H., & Selman, B. (2000). Generating satisfiable problem instances. In Proc. AAAI, pp. 256-261.
3. Achlioptas, D., Jia, H., &: Moore, C. (2004). Hiding satisfying assignments: two are better than one. In Proc. AAAI, pp. 131-136.
4. Achlioptas, D., & Moore, C. (2002a). Almost all graphs with average degree 4 are 3-colorable. In Proc. STOC, pp. 199-208.
5. Achlioptas, D., &: Moore, C. (2002b). The asymptotic order of the random k-SAT threshold. In Proc. FOCS, pp. 779-788.
6. k(ln2 - o(k)). In Proc. STOC, pp. 223-231.
7. Asahiro, Y., Iwama, K., &: Miyano, E. (1996). Random generation of test instances with controlled attributes. DIMACS Series in Disc. Math. and Theor. Comp. Sci., 26.
8. Barthel, W., Hartmann, A., Leone, M., Ricci-Tersenghi, F., Weigt, M., & Zecchina, R. (2002). Hiding solutions in random satisfiability problems: A statistical mechanics approach. Phys. Rev. Lett., 88(188701).
9. Chao, M., & Franco, J. (1986). Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput., 15(4), 1106-1118.
10. Cheeseman, P., Kanefsky, R., & Taylor, W. (1991). Where the really hard problems are. In Proc. IJCAI, pp. 163-169.
11. Cocco, S., & Monasson, R. (2004). Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances. Theor. Comp. Sci., 320, 345-372.
12. Cocco, S., Monasson, R., Montanari, A., & Semerjian, G. (2005). Approximate analysis of search algorithms with "physical" methods. In Percus, A., Istrate, G., & Moore, C. (Eds.), Computational Complexity and Statistical Physics. Oxford University Press.
13. Hogg, T., Huberman, B., & Williams, C. (1996). Phase transitions and complexity. Artificial Intelligence, 81.
14. Johnson, D., Aragon, C., McGeoch, L., & Shevon, C. (1989). Optimization by simulated annealing: an experimental evaluation. Operations Research, 57(6), 865-892.
15. Kautz, H., Ruan, Y., Achlioptas, D., Gomes, C., Selman, B., & Stickel, . (2001). Balance and filtering in structured satisfiable problems. In Proc. IJCAI, pp. 351-358.
16. Kullmann, O. (2002). Investigating the behaviour of a SAT solver on random formulas. Tech. rep. CSR 23-2002, University of Wales Swansea.
17. Mézard, M., & Zecchina, R. (2002). Random k-satisfiability: from an analytic solution to a new efficient algorithm. Phys. Rev. E, 66, 056126.
18. Mitchell, D., Selman, B., & Levesque, H. (1992). Hard and easy distributions of SAT problems. In Proc. AAAI, pp. 459-465.
19. Morris, P. (1993). The breakout method for escaping from local minima. In Proc. AAAI, pp. 40-45.
20. Selman, B., Kautz, H., & Cohen, B. (1996). Local search strategies for satisfiability testing. In Proc. 2nd DIMACS Challange on Cliques, Coloring, and Satisfiability.
21. Semerjian, G., &: Monasson, R. (2003). A study of pure random walk on random satisfiability problems with "physical" methods. LNCS, 2919, 120-134.
22. Shaw, P., Stergiou, K., & Walsh, T. (1998). Arc consistency and quasigroup completion. In Proc. ECAI, workshop on binary constraints.
23. Van Gelder, A. (1993). Problem generator mkcnf.c. In Proc. DIMACS. Challenge archive. Zhang, L. (2002). zChaff.. ee.princeton.edu/~chaff/zchaff. php.