SymChaff: A structure-aware satisfiability solver

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 467-474

  Sabharwal, Ashish ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; BOOLEAN ALGEBRA; COMPUTATION THEORY; ENCODING (SYMBOLS); FIELD PROGRAMMABLE GATE ARRAYS;

LOGISTICS PLANNING; PSEDUO-BOOLEAN SOLVERS; SATISFIABILITY SOLVER;

ARTIFICIAL INTELLIGENCE;

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

References (36)

1. [Aloul et al. 2002a] Aloul, F. A.; Ramani, A.; Markov, I. L.; and Sakallah, K. A. 2002a. PBS: A backtrack-search pseudo-boolean solver and optimizer. In 5th SAT, 346-353.
2. [Aloul et al. 2002b] Aloul, F. A.; Ramani, A.; Markov, I. L.; and Sakallah, K. A. 2002b. Solving difficult SAT instances in the presence of symmetry. In 39th DAC, 731-736.
3. [Aloul, Markov, & Sakallah 2003] Aloul, F. A.; Markov, I. L.; and Sakallah, K. A. 2003. Shatter: Efficient symmetry-breaking for boolean satisfiability. In 40th DAC, 836-839.
4. [Bayardo Jr. & Schrag 1997] Bayardo Jr., R. J., and Schrag, R. C. 1997. Using CST look-back techniques to solve real-world SAT instances. In 14th AAAI, 203-208.
5. [Beame, Kautz, & Sabharwal 2004] Beame, P.: Kautz, H.; and Sabharwal, A. 2004. Understanding and harnessing the potential of clause learning. JAIR 22:319-351.
6. [Biere et al. 1999] Biere, A.: Cimatti, A.; Clarke, E. M.; Fujita, M.: and Zhu, Y. 1999. Symbolic model checking using SAT procedures instead of BDDs. In 36th DAC, 317-320.
7. [Chai & Kuehlmann 2003] Chai, D., and Kuehlmann, A. 2003. A fast pseudo-boolean constraint solver. In 40th DAC, 830-835.
8. [Cook, Coullard, & Turan 1987] Cook, W.; Coullard, C. R.; and Turan, G. 1987. On the complexity of cutting plane proofs. Discr. Applied Mathematics 18:25-38.
9. [Crawford et al. 1996] Crawford, J. M.; Ginsberg, M. L.; Luks, E. M.; and Roy, A. 1996. Symmetry-breaking predicates for search problems. In 5th KR, 148-159.
10. [Davis, Logemann, & Loveland 1962] Davis, M.: Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. CACM 5:394-397.
11. [Dixon et al. 2004] Dixon, H. E.; Ginsberg, M. L.; Luks, E. M.; and Parkes, A. J. 2004. Generalizing boolean satisfiability II: Theory. JAIR 22:481-534.
12. [Dixon, Ginsberg, & Parkes 2004] Dixon, H. E.; Ginsberg, M. L.; and Parkes, A. J. 2004. Generalizing boolean satisfiability I: Background and survey of existing work. JAIR 21:193-243.
13. [Fikes & Nilsson 1971] Fikes, R. E., and Nilsson, N. J. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. J, AI 2(3/4): 198-208.
14. [Gallier 1986] Gallier, J. H. 1986. Logic for Computer Science. Harper & Row.
15. [Goldberg & Novikov 2002] Goldberg, E., and Novikov, Y. 2002. BerkMin: A fast and robust sat-solver. In DATE, 142-149.
16. [Gomes et al. 1998] Gomes, C. P.; Selman, B.; McAloon, K.; and Tretkoff, C. 1998. Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In 4th Int. Conf. An. Intel. Planning Syst.
17. [Haken 1985] Haken, A. 1985. The intractability of resolution. Theoretical Comput. Sci. 39:297-305.
18. [Kautz & Selman 1992] Kautz, H. A., and Selman, B. 1992. Planning as satisfiability. In Proc., 10th Euro. Conf. on AI, 359-363.
19. [Kautz & Selman 1998] Kautz, H. A., and Selman, B. 1998. BLACKBOX: A new approach to the application of theorem proving to problem solving. In Workshop on Planning as Combinatorial Search, held in conjunction with AIPS-98.
20. [Köbler, Schöning, & Torán 1993] Köbler, J.: Schöning. U.: and Torán, J. 1993. The Graph Isomorphism Problem: its Structural Complexity. Birkhauser Verlag.
21. [Konuk & Larrabee 1993] Konuk, H., and Larrabee, T. 1993. Explorations of sequential ATPG using boolean satisfiability. In 11th VLSI Test Symposium, 85-90.
22. [Krishnamurthy 1985] Krishnamurthy, B. 1985. Short proofs for tricky formulas. Acta Inf. 22:253-274.
23. [Li, Jurkowiak, & Purdom 2002] Li, C. M: Jurkowiak, B.; and Purdom, P. W. 2002. Integrating symmetry breaking into a DLL procedure. In SAT, 149-155.
24. [Marques-Silva & Sakallah 1996] Marques-Silva, J. P., and Sakallah, K. A. 1996. GRASP - a new search algorithm for satisfiability. In ICCAD, 220-227.
25. [Marques-Silva & Sakallah 1997] Marques-Silva, J. P., and Sakallah, K. A. 1997. Robust search algorithms for test pattern generation. In 27th FTCS, 152-161.
26. [McAllester, Selman, & Kautz 1997] McAllester, D. A.; Selman, B.; and Kautz, H. 1997. Evidence for invariants in local search. In AAAI/IMI, 321-326.
27. [Moskewicz et al. 2001] Moskewicz, M. W.; Madigan, C. F.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In 38th DAC, 530-535.
28. [Motter & Markov 2002] Motter, D. B., and Markov, I. 2002. A compressed breadth-first search for satisfiability. In ALENEX, volume 2409 of LNCS, 29-42. San Francisco, CA: Springer.
29. [Motter, Roy, & Markov 2005] Motter, D. B.; Roy, J. A.; and Markov, I. 2005. Resolution cannot polynomially simulate compressed-BFS. Ann. of Math. and A.I. 44(1-2): 121-156.
30. [Nadel 2002] Nadel, A. 2002. The Jerusat SAT solver. Master's thesis Hebrew University of Jerusalem.
31. [Pudlák 1997] Pudlák, P. 1997. Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Logic 62(3):981-998.
32. [Raz 2004] Raz, R. 2004. Resolution lower bounds for the weak pigeonhole principle. J. Assoc. Comput. Mach. 51(2):115-138.
33. [Shtrichman 2004] Shtrichman, O. 2004. Accelerating bounded model checking of safety properties. Form. Meth. in Sys. Des. 1:5-24.
34. [Stephan, Brayton, & Sangiovanni-Vincentelli 1996] Stephan, P. R.; Brayton, R. K.; and Sangiovanni-Vincentelli, A. L. 1996. Combinatorial test generation using satisfiability. IEEE Trans. Comput.-Aided Design Integr. Circ. 15(9):1167-1176.
35. [Velev & Bryant 2001] Velev, M., and Bryant, R. 2001. Effective use of boolean satisfiability procedures in the formal verification of superscalar and vliw microprocessors. In 38th DAC, 226-231.
36. [Zhang 1997] Zhang, H. 1997. SATO: An efficient prepositional prover. In 14th CADE, volume 1249 of LNCS, 272-275.