Towards industrial-like random SAT instances

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 387-392

  Ansótegui, Carlos ^a   Bonet, Maria Luisa ^b   Levy, Jordi ^c  

^a UNIVERSITY OF LLEIDA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c CSIC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS;

COMPUTATIONAL PROPERTIES; PHASE TRANSITION PHENOMENON; PHASE TRANSITION POINT; RANDOM GENERATION; RANDOM INSTANCE; REAL-WORLD; SAT INSTANCES;

PROBABILITY DISTRIBUTIONS;

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

References (12)

1. C. Ansótegui,M. L. Bonet, J. Levy, and F. Manyà. Measuring the hardness of sat instances. In Proc. of the 23th AAAI Conf. on Artificial Intelligence, AAAI'08, 2008.
2. R. Bayardo and R. Schrag. Using CSP look-back techniques to solve exceptionally hard SAT instances. In Proc. of the 2nd Int. Conf. on Principles and Practice of Constraint Programming, CP'96, pages 46-60, 1996.
3. Y. Boufkhad, O. Dubois, Y. Interian, and B. Selman. Regular random k-sat: Properties of balanced formulas. J. Autom. Reasoning, 35(1-3):181-200, 2005.
4. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
5. O. Dubois and G. Dequen. A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In Proc. of the 17th Int. Joint Conf. on Artificial Intelligence, IJCAI' 01, pages 248-253, 2001.
6. N. Eén and N. Sörensson. An extensible SAT-solver. In Proc. of the 6th Int. Conf on Theory and Applications of Satisfiability Testing, SAT'03, pages 502-518, 2003.
7. M. J. Heule and H. van Maaren. Whose side are you on? finding solutions in a biased search-tree. Journal on Satisfiability, Boolean Modeling and Computation, 4:117-148, 2008.
8. H. A. Kautz and B. Selman. Ten challenges redux: Recent progress in propositional reasoning and search. In Proc. of the 9th Int. Conf. on Principles and Practice of Constraint Programming, CP'03, pages 1-18, 2003.
9. C. M. Li and Anbulagan. Look-ahead versus look-back for satisfiability problems. In Proc. of the 13th Int. Conf. on Principles and Practice of Constraint Programming, CP'07, pages 341-355, 1997.
10. D. N. Pham, J. Thornton, C. Gretton, and A. Sattar. Advances in local search for satisfiability. In Proc. of the 20th Australian Conf. on Artificial Intelligence, pages 213-222, 2007.
11. B. Selman, H. A. Kautz, and D. A. McAllester. Ten challenges in propositional reasoning and search. In Proc. of the 15th Int. Joint Conf. on Artificial Intelligence, IJCAI'97, pages 50-54, 1997.
12. R.Williams, C. P. Gomes, and B. Selman. Backdoors to typical case complexity. In Proc. of the 18th Int. Joint Conf. on Artificial Intelligence, IJCAI'03, pages 1173- 1178, 2003.