An Evolutionary Local Search Algorithm for the Satisfiability Problem
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.
KeywordsLocal Search Test Instance Conjunctive Normal Form Local Search Method Satisfying Assignment
Unable to display preview. Download preview PDF.
- 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.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.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.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.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.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
- 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.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