Author:
Vander-Swalmen Pascal,Dequen Gilles,Krajecki Michaël
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Cook, S.A.: The Complexity of Theorem Proving Procedures. In: 3rd ACM Symp. on Theory of Computing, Ohio, pp. 151–158 (1971)
2. Braunstein, A., Mézard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms 27(2), 201–226 (2005)
3. Kautz, H., Selman, B.: Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. In: Proc. of the 30th National Conf. on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conf., Menlo Park, August 4–8, 1996, pp. 1194–1201. AAAI Press / MIT Press (1996)
4. Biere, A., Heljanko, K., Junttila, T., Latvala, T., Schuppan, V.: Linear encodings of bounded LTL model checking. Logical Methods in Computer Science 2 (2006)
5. Potlapally, N.R., Raghunathan, A., Ravi, S., Jha, N.K., Lee, R.B.: Aiding side-channel attacks on cryptographic software with satisfiability-based analysis. IEEE Trans. VLSI Syst. 15(4), 465–470 (2007)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SMPP: Generic SAT Solver over Reconfigurable Hardware Accelerator;2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum;2012-05
2. Improving GASAT by replacing tabu search by DLM and enhancing the best members;Artificial Intelligence Review;2009-12-23
3. A Collaborative Approach for Multi-Threaded SAT Solving;International Journal of Parallel Programming;2009-04-23