Author:
Zhang Jianmin,Li Tiejun,Ma Kefan
Reference25 articles.
1. Moskewicz, M.W., Madigan, C.F., Zhao Y., et al.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, pp. 530–535. ACM, Las Vegas, USA (2001)
2. Lecture Notes in Computer Science;N Eén,2004
3. Jain, H., Kroening, D.: Word level predicate abstraction and refinement for verifying RTL Verilog. In: Proceedings of the 42nd Design Automation Conference, pp. 445–450. ACM, Anaheim, San Diego, USA (2005)
4. Liffiton, M.H., Mneimneh, M.N., Lynce, I., et al.: A branch and bound algorithm for extracting smallest minimal unsatisfiable formulas. Constraints 14(4), 415–442 (2009)
5. Zhang, J.M., Li, S.K., Shen, S.Y.: Algorithms for Deriving minimum unsatisfiable Boolean subformulae. Acta Electronica Sinica 37(3), 56–59 (2009)