Asynchronous team algorithms for Boolean Satisfiability
Carlos Rodríguez, Marcos Villagra, Benjamı́n Barán · 2007
The Boolean Satisfiability Problem or SAT is one of the most important problems in computer science. Nowadays, there are different types of algorithms to solve instances with thousands of variables, and much research is being carried out looking for more efficient algorithms to solve larger and harder instances. This work proposes the utilization of a Team Algorithm (TA) strategy combining different local search algorithms for SAT as WalkSAT, R-Novelty+, Adaptive Novelty+, RSAPS, IROTS and SAMD. TAs allow the combination of different algorithms that interact with each other searching for a good global solution. Experimental results show that the proposed TA is a general strategy capable of obtaining promising results for a variety of instances.