An Evolutionary Local Search Algorithm for the Satisfiability Problem

  • Levent Aksoy
  • Ece Olcay Gunes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3949)


Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results on hard problems, but they may be time-consuming because of their branch and bound structures. In this manner, many successful incomplete algorithms are introduced. In this paper, the improvement of incomplete algorithms is of interest and it is shown that the incomplete algorithms can be more efficient if they are equipped with the problem specific knowledge, goal-oriented operators, and knowledge-based methods. In this aspect, an evolutionary local search algorithm is implemented, tested on a randomly generated benchmark that includes test instances with different sizes, and compared with prominent incomplete algorithms. Also, effects of goal-oriented genetic operators and knowledge-based methods used in the evolution-ary local search algorithm are examined by making comparisons with blind operators and random methods.


Local Search Test Instance Conjunctive Normal Form Local Search Method Satisfying Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cook, S.: The Complexity of Theorem-Proving Procedures. In: Proceedings of Third Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM, New York (1971)CrossRefGoogle Scholar
  2. 2.
    Brayton, K.R., Sangiovanni-Vincentelli, L.A., McMullen, T.C., Hachtel, D.G.: Logic Minimization Algorithms for VLSI Minimization. Kluwer, Boston (1985)MATHGoogle Scholar
  3. 3.
    Larrabee, T.: Efficient Generation of Test Patterns Using Boolean Satisfiability. IEEE Transactions on Computer-Aided Design 11(1), 4–15 (1992)CrossRefGoogle Scholar
  4. 4.
    Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of ACM 7, 201–215 (1960)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Marques-Silva, J.P., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers 48(5), 506–521 (1999)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proceedings of Tenth National Conference on Artificial Intelligence, pp. 440–446. AAAI Press, California (1992)Google Scholar
  7. 7.
    Selman, B., Kautz, H., Cohen, B.: Noise Strategies for Improving Local Search. In: Proceedings of Twelfth National Conference on Artificial Intelligence, pp. 337–343. AAAI Press, California (1994)Google Scholar
  8. 8.
    Spears, W.M.: Simulated Annealing for Hard Satisfiability Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 533–558 (1996)Google Scholar
  9. 9.
    Mazure, B., Sais, L., Gregoire, E.: Tabu search for SAT. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference, pp. 281–285 (1997)Google Scholar
  10. 10.
    Marchiori, E., Rossi, C.: A Flipping Genetic Algorithm for Hard 3-SAT Problems. In: Proceedings of Genetic and Evolutionary Conference, pp. 393–400. Morgan Kaufmann, California (1999)Google Scholar
  11. 11.
    Rossi, C., Marchiori, E., Kok, J.: An Adaptive Evolutionary Algorithm for the Satisfiability Problem. In: Proceedings of ACM Symposium on Applied Computing, pp. 463–469. ACM, New York (2000)Google Scholar
  12. 12.
    Gottlieb, J., Marchiori, E., Rossi, C.: Evolutionary Algorithms for the Satisfiability Problem. Evolutionary Computation 10(1), 35–50 (2002)CrossRefGoogle Scholar
  13. 13.
    Aksoy, L., Tekin, O.A.: Hybridization of Local Search Algorithms with a Simple Genetic Algorithm for the Satisfiability Problem. In: Proceedings of International Symposium on Innovations in Intelligent Systems and Applications, pp. 235–238 (2005)Google Scholar
  14. 14.
    Hampson, S., Kibler, D.: Large Plateaus and Plateau Search in Boolean Satisfiability Problems: When to Give Up Searching and Start Again. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 437–455 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Levent Aksoy
    • 1
  • Ece Olcay Gunes
    • 1
  1. 1.Faculty of Electrical and Electronics Engineering Department of Electronics and Communication EngineeringIstanbul Technical UniversityMaslak, IstanbulTurkey

Personalised recommendations