Evolutionary local search algorithm for the satisfiability problem

AKSOY L., Gunes E. O.

ARTIFICIAL INTELLIGENCE AND NEURAL NETWORKS, vol.3949, pp.185-193, 2006 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 3949
  • Publication Date: 2006
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Compendex, EMBASE, MathSciNet, Philosopher's Index, zbMATH
  • Page Numbers: pp.185-193
  • Istanbul Technical University Affiliated: Yes


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 evolutionary local search algorithm are examined by making comparisons with blind. operators and random methods.