Publisher
Springer International Publishing
Reference39 articles.
1. Alekhnovich, M., Razborov, A.A.: Satisfiability, branch-width and Tseitin tautologies. In: Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS 2002), Vancouver, BC, Canada, pp. 593–603. IEEE Computer Society, November 2002
2. Andersson, G., Bjesse, P., Cook, B., Hanna, Z.: A proof engine approach to solving combinational design automation problems. In: Proceedings of the 39th Design Automation Conference, DAC 2002, New Orleans, LA, USA, pp. 725–730. ACM, June 2002
3. Andrade, F.V., Oliveira, M.C.M., Fernandes, A.O., Coelho Jr., C.J.N.: SAT-based equivalence checking based on circuit partitioning and special approaches for conflict clause reuse. In: Girard, P., Krasniewski, A., Gramatová, E., Pawlak, A., Garbolino, T. (eds.) Proceedings of the 10th IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS 2007), Kraków, Poland, pp. 397–402. IEEE Computer Society, April 2007
4. Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. (JAIR) 22, 319–351 (2004)
5. Beame, P., Liew, V.: Towards verifying nonlinear integer arithmetic. CoRR, abs/1705.04302 (2017)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献