Boolean satisfiability from theoretical hardness to practical success

Communications of the ACM

Volumn 52, Issue 8, 2009, Pages 76-82

  Malik, Sharad ^a   Zhang, Lintao ^b  

^a Princeton University   (United States)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY; SATISFIABILITY SOLVERS; THEORETICAL HARDNESS;

BOOLEAN FUNCTIONS;

EID: 69149105621     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1536616.1536637     Document Type: Review

References (41)

1. Barrett. C., Sebastiani, R., Soshia, S., and Tinelli, C. Satisfiability modulo theories, A. Biore. H. van Maaren, T. Walsh, Eds. Handbook of Satisfiability 4. 8 (2009), IOS Press, Amsterdam.
2. Bayardo R., and Sohrag. R. Using CSP look-back techniques to solve real-world SAT instances. National Conference on Artificial Intelligence. 1997.
3. Biere, A., Cimatti, A., Clarke, E. M., and Zhu, Y. Symbolic model checking without BDDs. Tools and Algorithms for the Analysis and Construction of Systems, 1990.
4. Braunstein, A., Mezard, M., and Zecohina, R. Survey propagation: An algorithm for Satisfiability, Random Structures ana Algorithms 77 (2005), 201-276.
5. Bryant, R.E. Graph-based algorithms for Boolean function manipulation, IEEE Transactions, on Computers C-35 (1986), 677-691.
6. Clarke, E.M., Grumberg, O., and Peled. D.A. Model Checking MIl Press. Cambridge, MA, 1999.
7. Copty, F., Fix, L. Fraer, R., Giunchiglia, E. Kamhi, G., Tacchella, A., and Vardi, M.Y, Benefits of bounded model checking at an Industrial setting, Proceedings of the 13th International Conference on Computer-Aided Verification, 2001.
8. Cook, S.A. The complexity of theorem-proving procedures, Third Annual ACM Symposium on Theory of Computing. 1071.
9. Davis. M., Logemann, G., and Loveland, D.A machine program for theorem proving, Comm. ACM5(1962), 304-307.
10. Davis. M., and Putnam, H. A computing procedure for quantification theory. JACM 7 (1960), 201-215.
11. Eén, N., and Biere, A. Effective preprocessing in SAT through variable and clause elimination. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing. 7005.
12. Garey. M.R., and Johnson. D.S. Computers and Intiuetability: A Guide to the Theory of NPCompleteness. W. H. Freeman, 1979.
13. Gomes. C. P., Selman, B. and Kautz, H. Boosting combinatorial search through randomization. In Proceedings of National Conference on Artificial Intelligence (Madison, WI, 1008).
14. Hamadi. Y., Jabbour, S., and Sais. L. ManySat: Solver description. Microsoft Research. IR 2008 83.
15. Huth, M. and Ryan. M. Logic in Computer Science: Modeling and Reasoning about Systems. Cambridge University Press. 2004.
16. Hutter, F., Bable, D., Moos, H.H., and Hu, A. J. Boosting verification by automatic tuning of decision procedures In Proceedings of the International Conference on Formal Methods in Computer-Aided Design, (Austin, TX, Nov. 2007).
17. Jackson, D., and Vaziri, M., Finding bugs with a constraint solver, In Proceedings of the International Symposium on Software Testing and Analysis (Portland. OR. 2000).
18. Jain, H. Verification using satisfiability checking, predicate abstraction, and Craig interpolation. Ph.D, Thesis, Carnegie-Mellon University, School of Computer Science, CMU-CS-08-146,7008.
19. Johnson, D.S., Mehrotra, A., and Irick, M. A. Preface: Special issue on computational methods for graph coloring and Its generalizations, Discrete Applied Mathematics 156, 2: Computational Methods for Graph Coloring and its Generalizations, (Jan. 15,7008), 145- 146.
20. Kautz, H. and Selman, B. Planning as satisfiability, European Conference on Artificial Intelligence. 1992,
21. Larrabee, T. Test pattern generation using Boolean satisfiability, IEEE Transactions on Computer-Aided Design (Jan. 1992) 4-15.
22. Madigan, M.W., Madigan, C.F., Zhao, Y., Zhang, L., and Malik, S. Chaff: Engineering an efficient SAT solver. In Proceedings of the 30th Conference on Design Automation, (New York, NY, 2001).
23. Marchiori, E. and Rossi, C. A flipping genetic algorithm for hard 3. SAT problems, In Proceedings of the Genetic and Evolutionary Computation Conference (Orlando FL, 1999), 303 400.
24. Marques-Silva, J.P. and Sakallah, K,A, Conflict analysis in search algorithms for propositlonal satisfiability IEEE International Conference on Tools with Artificial Intelligence, 1996.
25. Mazure, L., Sas L. and Grgolre, E., Iabu search tor SAI, In Proceedings of the 14th National Conference on Artificial Intelligence (Providence, RI, 1997;.
26. McMillan, K.L., Applying SAT methods in unbounded symbolic model checking, In Proceedings of the 14th International Conference on Computer Aided Verification. Lecture Notes In Computer Science 2404 (2002;, Springer-Verlag, London, 250-264.
27. Muscettola, N., Pandurang Nayak, P., Pell, B., and Williams, B.C. Remote agent: To boldly go where no AI system has gone before, Artificial Intelligence 103. 1-2. (1998). 5-47.
28. Nam, G.-J., Sakallah, K. A., and Rutenbar, R.A. Satisfiability-based layout revisited: Detailed routing 01 complex FPGAs via search based Boolean SAT. International Symposium on Field-Programmable Cate Arrays (Monterey, CA. 1999).
29. Narain, S., Levin, G., Kaul, V., Malik, S. Declarative infrastructure configuration and debugging, Journal of Network Systems and Management. Special Issue on Security Configuration Springer, 2008.
30. Selman, B., Kautz. H.A., and Cohen, B. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence (Seattle, WA, 1994), American Association for Artificial Intelligence, Menlo Park, CA. 337-343.
31. Selman, B., Levesque, H., and Mitchell, D. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence, (1992) 440-446.
32. Seshla. S.A., Lahiri, S.K., and Bryant, R.E, A hybrid SAT-based decision procedure for separation logic with uninterpreted functions, In Proceedings of the 40th Conference on Design Automation (Anaheim, CA.
33. June 7-6, 2003), ACM, NY, 475-430; http://doi.aom. org/10.1145/775832. 775045.
34. Spears, W.M. Simulated annealing for hard satisfiability problems, Cliques. Coloring and Satisfiability, Second DIMACS Implementation Challenge DIMACS Series in Discrete Mathematics and Theoretical Computer Science. D.S. Johnson and M.A. Trick, Eds, American Mathematical Society (1993), 533-553.
35. Spears, W. M. A NN algorithm for Boolean satisfiability problems, In Proceedings of the 1996 International Conference on Neural Networks. 1121-1126.
36. Stälmarck, G, A system for determining prepositional logic theorems by applying values and rules to triplets that are generated from a formula, U.S. Patent Number 5776897.1994.
37. Tseitin, G, On the complexity of derivation in propositlonal calculus, In Studies in Constructive Mathematics and Mathematical Logic. Part 2(1968), 115-125, Reprinted in Automation of reasoning vol 2. J. Slekmann and G, Wrightson, Eds, Springer Verlag, Berlin, 1083, 400-483,
38. Williams, R., Gomes, C., and Selman, B. Backdoors to typical case complexity, In Proceeaingx of the 18th International Joint Conference on Artificial Intelligence (2003), 1173-1178,
39. Williams, R., Gomes, C., and Selman, P., On the connections between heavy tails, backdoors, and restarts in combinatorial search, In Proceedings of the International Conference on Theory and Applications of Satistiability Testing. 2003.
40. Xu, L., Mutter, F., Hoos, H. H. Leyton-Brown, K, SATzilla: Portlollo-based algorithm selection for SAI, Journal of Artificial Intelligence Research 32, (2008), 565-606.
41. Zhang, H. Generating college conference basketball schedules by a SAT solver, In Proceedings of the 5th International Symposium on Theory ana Applications of Satistiability Testing. (Cincinnati, OH, 2002).