Author:
Zhang Lintao,Malik Sharad
Publisher
Springer Berlin Heidelberg
Reference57 articles.
1. S. A. Cook, “The complexity of theorem-proving procedures,” presented at Third Annual ACM Symposium on Theory of Computing, 1971.
2. H. Kautz and B. Selman, “Planning as Satisfiability,” presented at European Conference on Artificial Intelligence(ECAI-92), 1992.
3. P. Stephan, R. Brayton, and A. Sangiovanni-Vencentelli, “Combinational Test Generation Using Satisfiability,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 15, pp. 1167–1176, 1996.
4. D. Jackson and M. Vaziri, “Finding Bugs with a Constraint Solver,” presented at International Symposium on Software Testing and Analysis, Portland, OR, 2000.
5. M. Davis and H. Putnam, “A computing procedure for quantification theory,” Journal of ACM, vol. 7, pp. 201–215, 1960.
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Impact of Satisfiability Solvers on Logic Locking;Understanding Logic Locking;2023-09-23
2. Model-based fleet deployment of edge computing applications;Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems;2020-10-16
3. Short Q-Resolution Proofs with Homomorphisms;Theory and Applications of Satisfiability Testing – SAT 2020;2020
4. Long-Distance Q-Resolution with Dependency Schemes;Journal of Automated Reasoning;2018-06-09
5. A New Cryptographic Scheme Utilizing the Difficulty of Big Boolean Satisfiability;International Journal of Mathematical, Engineering and Management Sciences;2018-03-01