1Davis M,Logemann G,Loveland D. A machine program for theorem-proving[J].Communica[ions of the ACM,1962,(07):394-397.
2Eén N,S(o)rensson N. An extensible SAT-solver[A].Berlin:SpringerVedag,2004.333-336.
3Guo Y,Zhang B,Zhang C. A heuristic restart strategy to speed up the solving of satisfiability problem[A].Washington DC:IEEE,2012.423-426.
4Brys T,Drugan M M,Bosman P A N. Local search and restart strategies for satisfiability solving in fuzzy logics[A].Washington DC:IEEE,2013.52-59.
5Lü Z,Hao J K. Adaptive memory-based local search for MAX-SAT[J].{H}Applied Soft Computing Journal,2012,(08):2063-2071.
6Bouhmala N,Salih S. A multilevel Tabu search for the maximum satisfiability problem[J].International Journal of Communications Network and System Sciences,2012,(10):661-670.
7Karaboga D. An idea based on honey bee swarm for numerical optimization[D].Erciyes:Erciyes University,2005.
8Karaboga D,Basrurk B. A powerful and efficient algorithm for numerical function optimization:artificial bee colony (ABC) algorithm[J].{H}Journal of Global Optimization,2007,(03):459-471.
9Karaboga D,Akay B. A modified artificial bee colony (ABC) algorithm for constrained optimization problems[J].{H}Applied Soft Computing Journal,2011,(03):3021-3031.
10Lardeux F,Saubion F,Hao J K. GASAT:a genetic local search algorithm for the satisfiability problem[J].{H}Evolutionary Computation,2006,(02):223-253.
