Author:
Chen ZhenYu,Xu BaoWen,Ding DeCheng
Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. Zhang J. The Satisfiability of Logic Formulas -Methods, Tools and Applications (in Chinese). Beijing: Science Press, 2000
2. Chen Z Y, Tao Z H, Xu B W, et al. Implication-based approximating bounded model checking. In: International Symposium on Fundamentals of Software Engineering, 2007, LNCS 4767: 350–363
3. Li X W, Li G H, Shao M. Formal verification techniques based on Boolean satisfiability problem. J Comput Sci Technol, 2006, 20: 38–47
4. Zhao X S. Complexity results on minimal unsatisfiable formulas—A survey. In: 9th Asian Logic Conference, 2005, 301–319
5. Cook S A. The complexity of theorem-proving procedures. In: 3rd ACM Symposium on Theory of Computing, 1971, 151–158
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献