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.

SAT, evolutionary algorithms, tabu search, recombination operators
This content is only available as a PDF.
© 2006 by the Massachusetts Institute of Technology
2006
You do not currently have access to this content.