An Efficient SAT Solving Algorithm Using Pseudo-Conflict Learning and Heterogeneous Computing
暂无分享,去创建一个
[1] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[2] Abdul Sattar,et al. Trap Avoidance in Local Search Using Pseudo-Conflict Learning , 2012, AAAI.
[3] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[4] Ju-Sung Kang,et al. A Study of the Parallelization of Hybrid SAT Solver using CUDA , 2014 .
[5] Rolf Wanka,et al. 3-SAT on CUDA: Towards a massively parallel SAT solver , 2010, 2010 International Conference on High Performance Computing & Simulation.
[6] Daniel Jackson,et al. Software Abstractions - Logic, Language, and Analysis , 2006 .
[7] Jie Cheng,et al. Programming Massively Parallel Processors. A Hands-on Approach , 2010, Scalable Comput. Pract. Exp..
[8] Helmut Veith,et al. SAT Based Predicate Abstraction for Hardware Verification , 2003, SAT.
[9] Alan M. Frieze,et al. Analyzing Walksat on Random Formulas , 2011, ANALCO.
[10] Lakhdar Sais,et al. ManySAT: a Parallel SAT Solver , 2009, J. Satisf. Boolean Model. Comput..
[11] John D. Owens,et al. A Work-Efficient Step-Efficient Prefix Sum Algorithm , 2006 .
[12] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.