GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem
2006 ◽
Vol 14
(2)
◽
pp. 223-253
◽
Keyword(s):
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.
2018 ◽
Vol 92
◽
pp. 276-288
◽
Keyword(s):
Keyword(s):
Keyword(s):
2009 ◽
Vol 198
(1)
◽
pp. 84-92
◽
2012 ◽
Vol 212
(1)
◽
pp. 185-200
◽
Keyword(s):
2013 ◽
Vol 46
◽
pp. 687-716
◽
Keyword(s):