Generation of hard non-clausal random satisfiability problems

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 436-442

  Navarro, Juan A ^a   Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

NON-CLAUSAL FORMULAS; SAT PROCEDURES; SATISFIABILITY PROBLEM;

ALGORITHMS; PHASE TRANSITIONS; PROBLEM SOLVING;

ARTIFICIAL INTELLIGENCE;

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

References (24)

1. k(In2 - O(k)). In STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 223-231. San Diego, CA, USA: ACM Press.
2. Altamirano, E., and Escalada-Imaz, G. 2000. An efficient proof method for non-clausal reasoning. In ISMIS '00: Proceedings of the 12th International Symposium on Foundations of Intelligent Systems, 534-542. Springer-Verlag.
3. 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.
4. Berre, L., and Simon. 2004. Fifty-five solvers in Vancouver: the SAT 2004 competition. In Theory and Applications of Satisfiability Testing: 7th International Conference, SAT 2004, Lecture Notes in Computer Sciences.
5. Cook, S. A., and Mitchell, D. G. 1997. Finding hard instances of the satisfiability problem: A survey. In Discrete Mathematics and Theoretical Computer Science, volume 5 of DIMACS. American Mathematical Society.
6. Creignou, N., and Daude, H. 2002. Random generalized satisfiability problems. In SAT 2002: Fifth International Symposium on the Theory and Applications of Satisfiability Testing.
7. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem-proving. Communications of the ACM 5:394-397.
8. Dubois, O., and Dequen, G. 2001. A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In Proc. of the 17th International Joint Conference on Artificial Intelligence (IJCAV 01).
9. Dubois, O.; Boufkhad, Y.; and Mandler, J. 2000. Typical random 3-SAT formulae and the satisfiability threshold. In SODA'00: Proc. of the eleventh annual ACM-SIAM symposium on Discrete algorithms, 126-127. San Francisco, CA: Society for Industrial and Applied Mathematics.
10. Friedgut, E. 1999. Sharp thresholds of graph properties and the k-SAT problem. Journal of the American Mathematical Society 12(4): 1017-1054.
11. Gent, I. P.; Macintyre, E.; Prosser, P.; Smith, B. M.; and Walsh, T. 2001. Random constraint satisfaction: Flaws and structure. Constraints 6(4):345-372.
12. Giunchiglia, E., and Sebastiani, R. 2000. Applying the Davis-Putnam procedure to non-clausal formulas. In AI*IA '99: Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial intelligence, 84-94. Springer-Verlag.
13. Heule, M.; van Zwieten, J.; Dufour, M.; and van Maaren, H. 2004. March-eq: Implementing additional reasoning into an efficient lookahead SAT solver. In Theory and Applications of Satisfiability Testing: 7th International Conference, SAT 2004, Lecture Notes in Computer Sciences.
14. Hoos, H. H. 2002. An adaptive noise mechanism for Walk-SAT. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), 655-660.
15. Kaporis, A. C.; Kirousis, L. M.; and Lalas, E. 2003. Selecting complementary pairs of literals. In Proc. UCS'03 Workshop on Typical Case Complexity and Phase Transitions.
16. Mitchell, D. G., and Levesque, H. J. 1996. Some pitfalls for experiments with random SAT. Artificial Intelligence 81:111-125.
17. Mitchell, D. G.; Selman, B.; and Levesque, H. 1992. Hard and easy distributions of SAT problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), 459-465.
18. Monasson, R., and Zecchina, R. 1997. Satistical mechanics of the random k-SAT model. Phys. Rev. E 56:1357-1370.
19. Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In 39th Design Automation Conference (DAC 2001).
20. Plaisted, D. A., and Greenbaum, S. 1986. A structure-preserving clause form translation. J. Symb. Comput. 2(3):293-304.
21. Selman, B.; Kautz, H. A.; and Cohen, B. 1994. Noise strategies for improving local search. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94).
22. Stachniak, Z. 2002. Going non-clausal. In SAT 2002: Fifth International Symposium on the Theory and Applications of Satisfiability Testing.
23. Thiffault, C.; Bacchus, F.; and Walsh, T. 2004. Solving non-clausal formulas with DPLL search. In Theory and Applications of Satisfiability Testing: 7th International Conference, SAT 2004, number 3258 in Lecture Notes in Computer Sciences, 663-678.
24. Tompkins, D. A., and Hoos, H. H. 2004. UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In Seventh Int'l Conf. on Theory and Applications of Satisfiability Testing (SAT2004).