Abstract
This chapter consists of two parts. In the first part we show that resolution based SAT-solvers cannot be scalable on real-life formulas unless some extra information about formula structure is known. In the second part we introduce a new way of satisfiability testing that may be used for designing more efficient and “intelligent” SAT-algorithms that will be able to take into account formula structure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
BerkMin web page. http://eigold.tripod.com/BerkMin.html
Bonet M., Pitassi T., Raz R. On interpolation and automatization for Frege systems. SIAM Journal on Computing, 29(6):1939–1967, 2000.
Brand D. Verification of large synthesized designs. Proceedings of ICCAD-1993, pp. 534–537.
Bryant R. Graph based algorithms for Boolean function manipulation. IEEE Trans. on Computers, C(35):677–691.
V. Chvatal, E. Szmeredi. Many hard examples for resolution. J. of the ACM, vol. 35, No 4, pp.759–568.
CUDD web page. http://vlsi.colorado.edu/~fabio/
M. Davis, G. Logemann, D. Loveland. A Machine program for theorem proving. Communications of the ACM, 1962, vol. 5, pp. 394–397.
Goldberg E., Novikov Ya. BerkMin: A fast and robust SAT-solver. Design, Automation, and Test in Europe (DATE’ 02), pp. 142–149, March 2002.
Goldberg E., Novikov Ya. How good are current resolution based SAT-solvers. presented at SAT-2003, Margherita Ligure — Portofino (Italy), May 5–8, 2003.
Goldberg E., Novikov Ya. Equivalence Checking of Dissimilar Circuits. Presented at IWLS-2003. Laguna Beach, California, USA, May 28–30, 2003.
E. Goldberg. Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points. Proceedings of Conference on Automated Deduction, CADE 2002, pp. 161–180.
E. Goldberg. Proving Unsatisfiability of CNFs locally. Journal of Automated Reasoning. vol 28:417–434, 2002.
A. Haken. The intractability of resolution. Theor. Comput. Sci. 39 (1985), 297–308.
F. Lu, L.-C. Wang, K.-T. Cheng, R. Huang. A circuit SAT solver with signal correlation guided learning, DATE-2003, pp. 892–898.
D. Mitchell, B. Selman, H.J. Levesque. Hard and easy distributions of SAT problems. Proceedings AAAI-92, San Jose, CA, 459–465.
M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik. Chaff: Engineering an effcient SAT-solver. Proceedings of DAC-2001, pp. 530–535.
C. Papadimitriou. On selecting a satisfying truth assignment. Proceedings of FOCS-91, pp. 163–169
Razborov A., Alekhnovich M. Resolution is not automatizable unless W[p] is tractable. Proc. of the 42nd IEEE FOCS-2001, pages 210–219.
B. Selman, H. Kautz, B. Cohen. Noise strategies for improving local search. Proceedings of AAAI-94, Vol. 1, pp. 337–343.
E. Sentovich, K. Singh, C. Moon, H. Savoj, R. Brayton, A. Sangiovanni-Vincentelli, Sequential circuit design using synthesis and optimization. Proceedings of ICCAD, pp 328–333, October 1992.
Silva J., Sakallah K. GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions of Computers, 1999, Vol. 48, pp. 506–521.
H. Wong-Toi. Private communication.
H. Zhang. SATO: An e cient propositionalprover. Proceedings of CADE-1997, pp. 272–275.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Goldberg, E. (2004). What SAT-solvers Can and Cannot Do. In: Drechsler, R. (eds) Advanced Formal Verification. Springer, Boston, MA. https://doi.org/10.1007/1-4020-2530-0_1
Download citation
DOI: https://doi.org/10.1007/1-4020-2530-0_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7721-0
Online ISBN: 978-1-4020-2530-3
eBook Packages: Springer Book Archive