Author:
de Moura Leonardo,Bjørner Nikolaj
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lewis, H.R.: Complexity results for classes of quantificational formulas. J. Comput. Syst. Sci. 21, 317–353 (1980)
2. Pérez, J.A.N., Voronkov, A.: Encodings of Bounded LTL Model Checking in Effectively Propositional Logic. In: [18], pp. 346–361.
3. Lecture Notes in Computer Science;N. Dershowitz,2005
4. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35, 677–691 (1986)
5. Lecture Notes in Computer Science;A. Voronkov,1996
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献