Generating hard satisfiable formulas by hiding solutions deceptively

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 384-389

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

^a University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DPLL ALGORITHMS; RANDOM TRUTH ASSIGNMENT; SEARCH ALGORITHMS;

ALGORITHMS; CONSTRAINT THEORY; POLYNOMIALS;

ARTIFICIAL INTELLIGENCE;

EID: 29344447565     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Achlioptas, D., and Moore, C. 2002a. Almost all graphs with average degree 4 are 3-colorable. STOC 199-208.
2. Achlioptas, D., and Moore, C. 2002b. The asymptotic order of the random k-SAT threshold. FOCS 779-788.
3. k(ln 2 - o(k)). STOC 223-231.
4. Achlioptas, D.; Beame, P.; and Molloy, M. 2001. A sharp threshold in proof complexity. STOC 337-346.
5. Achlioptas, D.; Gomes, C.; Kautz, H.; and Selman, B. 2000. Generating satisfiable problem instances. AAAI 256 -261.
6. Achlioptas, D.; Jia, H.; and Moore, C. 2004. Hiding satisfying assignments: two are better than one. AAAI 131-136.
7. Asahiro, Y.; Iwama, K.; and 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.; and Zecchina, R. 2002. Hiding solutions in random satisfiability problems: A statistical mechanics approach. Phys. Rev. Lett. 88(188701).
9. Chao, M., and Franco, J. 1986. Probabilistic analysis of two heuristics for the 3-salisriability problem. SIAM J. Comput. 15(4): 1106-1118.
10. Cheeseman, P.; Kanefsky, R.; and Taylor, W. 1991. Where the really hard problems are. IJCAI 163-169.
11. Cocco, S., and Monasson, R. 2004. Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances. Theor, Camp. Sci. 320:345-372.
12. Cocco, S.; Monasson, R.; Montanari, A.; and Semerjian, G. 2005. Approximate analysis of search algorithms with "physical" methods. In Percus, A.; Istrate, G.; and Moore, C., eds., Computational Complexity and Statistical Physics. Oxford University Press.
13. Hogg, T.; Huberman, B.; and Williams, C. 1996. Phase transitions and complexity. Artificial Intelligence 81.
14. Johnson, D.; Aragon, C.; McGeoch, I.; and Shevon, C. 1989. Optimization by simulated annealing: an experimental evaluation. Operations Research 37(6):865-892.
15. Kautz, H.; Ruan, Y.; Achlioptas, D.; Gomes, C.; Selman, B.; and Stickel,. 2001. Balance and filtering in structured satisfiable problems. IJCAI 351-358.
16. Kullmann, O. 2002. Investigating the behaviour of a SAT solver on random formulas. Technical Report CSR 23-2002, University of Wales Swansea.
17. Mézard, M., and 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.; and Levesque, H. 1992. Hard and easy distributions of SAT problems. AAAI 459-465.
19. Morris, P, 1993. The breakout method for escaping from local minima. AAAI 40-45.
20. Selman, B.; Kautz, H.; and Cohen, B. 1996. Local search strategies for satisfiability testing. 2nd DIMACS Challange on Cliques, Coloring, and Satisfiability.
21. Semerjian, G., and 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.; and Walsh, T. 1998. Arc consistency and quasigroup completion. ECAI workshop on non-binary constraints.
23. Van Gelder, A. 1993. Problem generator mkcnf. c. DI-MACS challenge archive.
24. Zhang, L. zChaff.ee.princeton.edu/~chaff/zchaff.php.