Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems

Applied Soft Computing Journal

Volumn 10, Issue 1, 2010, Pages 198-207

  Kilani, Yousef ^a  

^a HASHEMITE UNIVERSITY   (Jordan)

Author keywords

Comparison; Genetic algorithms: GASAT and SAT WAGA; Local search algorithms: ESG and DLM; SATs

Indexed keywords

COMPARISON; GENETIC-BASED ALGORITHMS; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; LOCAL SEARCH ALGORITHMS: ESG AND DLM; NP COMPLETE PROBLEMS; RESEARCH DIRECTIONS; SATISFIABILITY PROBLEMS; SATS; STOCHASTIC LOCAL SEARCHES; SUB-GRADIENT ALGORITHM;

FORMAL LOGIC; GENETIC ALGORITHMS; LAGRANGE MULTIPLIERS; LEARNING ALGORITHMS;

RESEARCH;

EID: 70350231771     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2009.07.012     Document Type: Article

References (54)

1. Lardeux F., Saubion F., and Hao J. GASAT: a genetic local search algorithm for the satisfiability problem. Proceeding of International Conference in Evolutionary Computation (2005)
2. Hao J., Lardeux F., and Saubion F. A hybrid genetic algorithm for the satisfiability problem. Proceeding of the 1st International Workshop on Heuristics (2002)
3. Choi K., Lee J., and Stucky P. A Lagrangian reconstruction of GENET. Journal of Artificial intelligence 123 (2000) 1-39
4. Yingbiao L. A genetic algorithm based on adapting clause weights. Chinese Journal of Computer 7 (2005) 20-32
5. Wu Z., and Wah B. An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. Proceeding of the 17th National Conference on Artificial Intelligence (2000) 310-315
6. Wu Z., and Wah B. Trap escaping strategies in discrete Lagrangian methods for solving hard satisfiability and maximum satisfiability problems. Proceeding of the 16th National Conference on Artificial Intelligence (1999) 673-678
7. Wu Z., and Wah B. Solving hard satisfiability problems: a unified algorithm based on discrete lagrange multipliers. Proceeding of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999) 210-217
8. Wu Z., and Wah B. The theory of discrete Lagrange multipliers for nonlinear discrete optimization. Proceeding of the Fifth International Conference on Principles and Practice of Constraint Programming (1999) 28-42
9. Goldberg E. Genetic algorithms in search. Proceeding of International Conference in Optimization & Machine Learning (1989)
10. Schuurmans D., Southey F., and Holte R. The exponentiated subgradient algorithm for heuristic Boolean programming. Proceeding of the International Joint Conference on Artificial Intelligence (2001) 334-341
11. Fang H., kilani Y., Lee J., and Stucky P. Reducing search space in local search for constraint satisfaction. Proceeding of the American Association for Artificial Intelligence (2002) 200-207
12. Selman B., Levesque H., and Mitchell D. A new method for solving hard satisfiability problems. Proceeding of the American Association for Artificial Intelligence (1992) 440-446
13. C. Thiffault, F. Bacchus, T. Walsh, Solving non-clausal formulas with DPLL search, Principles and Practice of Constraint Programming, 2004, pp. 663-678.
14. Tseitin G. On the complexity of proofs in propositional logics. Automation of Reasoning: Classical Papers in Computational Logic 2 (1970) 50-57
15. Hoos H.H. An adaptive noise mechanism for WalkSAT. Proceeding of the Eighteenth National Conference on Artificial Intelligence (AAAI-02) (2002) 635-660
16. Li C.M., and Huang W.Q. Diversification and determinism in local search for satisfiability. Proceedings of the Eighth International Conference on Theory and applications of Satisfiability Testing (SAT-05), Volume 3569 of Lecture Notes in Computer Science (LNCS) (2005) 158-172
17. Huttter F., Tompkins D.A.D., and Hoos H.H. Scaling and probabilistic smoothing: efficient dynamic local search for SAT. proceedings of the Eighth International Conference on Principle and Practice of Constraint Programming (CP-02), volume 2470 of Lecture Notes in Computer Science (LNCS) (2002) 233-248
18. Wah B.W., and Wu Z. Penalty formulations and trap-avoidance strategies for solving hard satisfiability problems. Journal of Computer Science and Technology, Springer-Verlag 20 1 (2005) 3-17
19. Audemard G., and Simon L. GUNSAT: a greedy local search algorithm for unsatisfiability. Proceeding of the International Joint Conference on Artificial Intelligence (2007)
20. Davis M., and Putnam H. a computing procedure for quantification theory. Journal of the Association for Computing Machinery 7 (1960) 201-215
21. Moskewicz M.W., Madigan C.F.Y., Zhao L., Zhang S., and Malik. Chaff: engineering an efficient SAT solver. Proceeding of the 38th ACM/IEEE Design Automation Conference. Las Vegas, Nevada (2001) 530-535
22. Aloul F., Ramani I., Markov I., and Sakallah K. PBS: a backtrack search pseudo-Boolean solver. Proceeding of the 5th International Conference on Theory and Applications of Satisfiability Testing (2002)
23. Anbulagan. Extending unit propagation look-ahead of DPLL procedure. Proceeding of Trends in Artificial Intelligence: 8th Pacific Rim International Conference on Artificial Intelligence (2004) 173-182
24. Bacchus F. Enhancing Davis Putnam with extended binary clause reasoning. Proceeding of National Conference on Artificial Intelligence (2002) 613-619
25. Majercik S.M., and Boots B. DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently. Proceeding of the Twentieth National Conference on Artificial Intelligence (2005) 416-422
26. Li C.M., and Huang W.Q. Diversification and determinism in local search for satisfiability. Proceedings of SAT-05 (2005) 158-172
27. Lynce I., and Marques-Silva J. The effect of nogood recording in DPLL-CBJ SAT algorithms. Journal of Recent Advances in Constraints (2003) 144-158
28. Jegou P., and Terrioux C. Decomposition and good recording for solving Max-CSPs. Proceeding of ECAI (2004) 196-200
29. Xu L., Hutter F., Hoos H.H., and Leyton-Brown. SATzilla: portfolio-based algorithm Selection for SAT. Journal of Artificial Intelligence Research 32 (2008) 565-606
30. K. Pipatsrisawat, A. Darwiche, RSat 1.03: SAT solver description, Technical report D152, Automated Reasoning Group, Computer Science Department, University of California, Los Angeles, 2006.
31. K. Pipatsrisawat, A. Darwiche, Rsat 2.0: SAT solver description, Technical report D-153, Automated Reasoning Group, Computer Science Department, UCLA, 2007.
32. Barrett C., and Berezin S. CVC lite: a new implementation of the cooperating validity checker. Proceeding of the 16th International Conference on Computer Aided Verification (CAV'04), Boston, Massachusetts, volume 3114 of Lecture Notes in Computer Science (2004), Springer 515-518
33. Stump A., Barrett B.C.W., and Dill D.L. CVC: a cooperating validity checker. Proceeding of the 14th International Conference on Computer Aided Verification (CAV'02), Copenhagen, Denmark, 2002, volume 2404 of Lecture Notes in Computer Science (2002), Springer 500-504
34. Audemard G., Le Berre D., Roussel O., Lynce I., and Marques-Silva J. OpenSAT: an open source SAT software project. Proceeding of International Conference on Theory and Applications of Satisfiability Testing (SAT2003) (2003) 502-509
35. Een N., and Sörensson N. An extensible SAT-solver. Proceeding of the International Conference on Theory and Applications of Satisfiability Testing (2003)
36. Een N., and Sörensson N. Effective preprocessing in SAT through variable and clause elimination. Proceeding of the International Conference on Theory and Applications of Satisfiability Testing (2005)
37. Pipatsrisawat K., and Darwiche A. A new clause learning scheme for efficient unsatisfiability proofs. Proceeding of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-08) (2008)
38. Barrett C., and Tinelli C. CVC3. Proceeding of the 19th International Conference on Computer Aided Verification (CAV'07), Berlin, Germany, volume 4590 of Lecture Notes in Computer Science (2007) 298-302
39. Zhang K., and Nagamatu M. Theoretical study on mixed parallel execution for solving SAT. International Congress Series 1301 (2007) 176-179
40. Pham D.-N., Thornton J., Gretton C., and Sattar A. Advances in local search for satisfiability. Proceedings of the 20th Australian Joint Conference on Artificial Intelligence (2007)
41. M. Mitchell, An Introduction to Genetic Algorithms, 1996.
42. Tompkins D.A., and Hoos H.H. UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. Proceeding of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT 2004) (2004) 37-46
43. Lardeux F., Saubion F., and Hao J. GASAT: a genetic local search algorithm for the satisfiability problem. Evolutionary Computation Journal 14 2 (2006) 223-253
44. Anbulagan D.N., Pham J., Slaney A., and Sattar. Old resolution meets modern stochastic local search. Proceeding of AAAI-05 (2005) 354-359
45. McAllester D.A., Selman B., and Kautz H.A. Evidence for invariants in local search. Proceedings of AAAI-97 (1997) 321-326
46. Li X.Y., Stallmann M.F., and Brglez F. QingTing: a fast SAT solver using local search and efficient unit propagation. Proceeding of International Conference on Theory and Applications of Satisfiability Testing (SAT2003) (2003)
47. Zhang H., and Stickel M.E. An efficient algorithm for unit propagation. Proceeding of the Fourth International Symposium on Artificial Intelligence and Mathematics (1996)
48. E. Hirsch, A. Kojevnikov, UnitWalk: a new SAT solver that uses local search guided by unit clause elimination (2001), Technical report PDMI preprint 9/2001, Steklov Institute of Mathematics at St. Petersburg, 2001.
49. H. Wenqi, Z. Defu, W. Houxiang, An algorithm based on tabu search for satisfiability problem, Journal of Computer Science and Technology 17 (3) (2002) 340-346.
50. Russell S., and Norvig P. Artificial Intelligence, a Modern Approach (2003), Prentice Hall Series in Artificial Intelligence pp. 736-748
51. Nagamatu M., and Yannaru T. On the stability of Lagrange programming neural networks of satisfiability problems of propositional calculus. Neurocomputing 13 (1995) 119-133
52. Mastrolilli M., and Gambardella L.M. Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?. European Journal of Operational Research 166 1 (2005) 63-76
53. The international SAT competitions web page, http://www.satcompetition.org/ (retrieved on 10-03-2009).
54. Sang T., Beame P., and Kautz H. A dynamic approach to MPE and weighted Max-SAT. Proceeding of the Twentieth International Joint Conference on Artificial Intelligence (2007) 173-197