Author:
Subbarayan Sathiamoorthy,Pradhan Dhiraj K.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Davis, M., Putnam, H.: A Computing procedure for quantification theory. J. of the ACM 7 (1960)
2. Davis, M., et al.: A machine program for theorem proving. Comm. of ACM 5(7) (1962)
3. Lecture Notes in Computer Science;F. Bachhus,2004
4. Brafman, R.I.: A simplifier for propositional formulas with many binary clauses. In: IJCAI 2001, pp. 515–522 (2001)
5. Goldberg, E., Novikov, Y.: BerkMin: a Fast and Robust SAT-Solver. In: Proc. of DATE 2002, pp. 142–149 (2002)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献