1[1]Dubois O,et al. Carlier, Can a very simple algorithm be efficient for solving the SAT problem ? DIMACS Chall. on SAT Testing, 1993
2[2]Davis M, Putnam H. A computing procedure forquantification theory. J. Assoc. Computing Machinery,1960,7:201～205
3[3]Gu J. Local Search for the Satisfiability (SAT)Problem. IEEE Transactions on Systems and Cybernetics, 1993,23 (3): 1108 ～1129.
4[5]Jeroslow R G,Wang J. Solving Propositional Satisfiability Problems. Annals of Mathematics and Artificial Intelligence, 1990,1:167～187
5[7]Selman B,Levesque H,Mitchell D. A New Method for Solving Hard Satisfiability Problems, IJCAI '93 (93.1)
6[8]Selman B,Kautz H,Cohen B. Noise strategies for improving local search. In:Proc. of the 12th National Conf. on Artificial Intelligence (Seattle, WA), 1994. 337～343
7[9]Yang L. A new method of automated theorem proving, in The Mathematical Revolution Inspired by Computing, J. H. Johnson and M. J. Loomes (eds), Oxford University Press, 1991. 115～126
8[10]Zhang H. SATO: An Efficient Propositional Prover,In: Proc. of Intl. Conf. on Automated Deduction (CADE～97), LNAI 1249,1997. 272～275
9[11]Zhang J,Yang L,Deng M. The parallel numerical method of mechanical theorem proving, Theoretical Computer Science, 1990,74:253～271
10[12]Zhang J, Zhang H. Combining Local Search and Backtracking Techniques for Constraint Satisfaction. AAAI/IAAI, 1996, 1:369～374
