Author:
Xu Yanyan,Chen Wei,Su Kaile,Zhang Wenhui
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Stephen, A.: Cook. The Complexity of Theorem-Proving Procedures. In: STOC, pp. 151–158. ACM (1971)
2. Velev, M.N., Bryant, R.E.: Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. J. Symb. Comput. 35(2), 73–106 (2003)
3. Nam, G.-J., Sakallah, K.A., Rutenbar, R.A.: A new FPGA detailed routing approach via search-based Boolean satisfiability. IEEE Trans. on CAD of Integrated Circuits and Systems 21(6), 674–684 (2002)
4. Kautz, H.A., Selman, B.: Planning as Satisfiability. In: ECAI, pp. 359–363 (1992)
5. Lecture Notes in Computer Science;J. Franco,2004