An evolutionary local search algorithm for the satisfiability problem

Authors:
Levent Aksoy;Ece Olcay Gunes
Affiliations:
Faculty of Electrical and Electronics Engineering Department of Electronics and Communication Engineering, Istanbul Technical University, Maslak, Istanbul, Turkey;Faculty of Electrical and Electronics Engineering Department of Electronics and Communication Engineering, Istanbul Technical University, Maslak, Istanbul, Turkey
Venue:
TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
Year:
2005

Citing 9
Cited 2

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
An adaptive evolutionary algorithm for the satisfiability problem

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis
Evolutionary algorithms for the satisfiability problem

Evolutionary Computation
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A new method for solving hard satisfiability problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Tabu search for SAT

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Finite satisfiability of propositional interval logic formulas with multi-objective evolutionary algorithms

Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
A survey of the satisfiability-problems solving algorithms

International Journal of Advanced Intelligence Paradigms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.