QingTing : A Fast SAT Solver Using Local Search and Efficient Unit Propagation
暂无分享,去创建一个
[1] Fahiem Bacchus. Exploring the Computational Tradeoff of more Reasoning and Less Searching , 2002 .
[2] Inês Lynce,et al. Efficient data structures for backtrack search SAT solvers , 2005, Annals of Mathematics and Artificial Intelligence.
[3] Joao Marques-Silva,et al. Search Algorithms for Satisfiability Problems in Combinational Switching Circuits , 1995 .
[4] Edward A. Hirsch,et al. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination , 2005, Annals of Mathematics and Artificial Intelligence.
[5] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[6] Thomas Stützle,et al. SATLIB: An Online Resource for Research on SAT , 2000 .
[7] Hantao Zhang,et al. SATO: An Efficient Propositional Prover , 1997, CADE.
[8] Matthias F. Stallmann,et al. The Role of a Skeptic Agent in Testing and Benchmarking of SAT Algorithms , 2002 .
[9] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[10] Mark E. Stickel,et al. Implementing the Davis–Putnam Method , 2000, Journal of Automated Reasoning.
[11] Hantao Zhang,et al. An Efficient Algorithm for Unit Propagation , 1996 .