A genetic-based local search method for SAT problem
Gakiza Canisius, Wilson Kalisa, Yuzhang Zhang, Yang Chenhui, Xin Hong · 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference · 2016
In this paper, we present a Genetic Local Search algorithm (GLS), for the satisfiability problem (SAT). The main feature of GLS is that a combination of stage focused on a Corrective Clause and Truth Maintenance (CCTV) is improved, Genetic Algorithm (GA) and Tabu Search (TS). We have conducted experiments to evaluate the different components of GLS algorithms. GLS provides very competitive results respectively indicated by our experimental.