ERA: An Algorithm for Reducing the Epistasis of SAT Problems [chapter]

Eduardo Rodriguez-Tello, Jose Torres-Jimenez
2003 Lecture Notes in Computer Science  
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited representation (with lower epistasis) for a Genetic Algorithm (GA) by preprocessing the original SAT problem; and b) A Genetic Algorithm that solves the preprocesed instances. ERA is implemented by a simulated annealing algorithm (SA), which transforms the original SAT problem by rearranging the variables to satisfy the
more » ... ion that the most related ones are in closer positions inside the chromosome. Results of experimentation demonstrated that the proposed combined approach outperforms GA in all the tests accomplished.
doi:10.1007/3-540-45110-2_4 fatcat:lwdetnszijciflezmdfrfhjpke