OpenSAT: An Open Source SAT Software Project
暂无分享,去创建一个
[1] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[2] Joao Marques-Silva,et al. GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.
[3] Eugene Goldberg,et al. BerkMin: A Fast and Robust Sat-Solver , 2002 .
[4] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.
[5] Hantao Zhang,et al. SATO: An Efficient Propositional Prover , 1997, CADE.
[6] Edward A. Hirsch,et al. The SAT2002 competition , 2004, Annals of Mathematics and Artificial Intelligence.
[7] Inês Lynce,et al. On Implementing More Efficient SAT Data Structures , 2003 .
[8] Òò׸¸ôñ×××øººòò Blockinºôø. On Implementing More EÆ ientSAT Data Stru turesInês , .
[9] Armando Tacchella,et al. Towards an Efficient Library for SAT: a Manifesto , 2001, Electron. Notes Discret. Math..
[10] Thomas Stützle,et al. Local Search Algorithms for SAT: An Empirical Evaluation , 2000, Journal of Automated Reasoning.
[11] Karem A. Sakallah,et al. GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.