Asynchronous team algorithms for Boolean Satisfiability

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.

[1]  Benjamín Barán,et al.  Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing , 2007, WoLLIC.

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  Holger H. Hoos,et al.  An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.

[4]  Jin-Kao Hao,et al.  GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem , 2006, Evolutionary Computation.

[5]  Holger H. Hoos,et al.  Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.

[6]  Daniel Singer.  Parallel Resolution of the Satisfiability Problem: A Survey , 2006 .

[7]  Holger H. Hoos,et al.  UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.

[8]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[9]  Holger H. Hoos,et al.  On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.

[10]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[11]  Eugenius Kaszkurewicz,et al.  Parallel Asynchronous Team Algorithms: Convergence and Performance Analysis , 1996, IEEE Trans. Parallel Distributed Syst..

[12]  Thomas Stützle,et al.  Iterated Robust Tabu Search for MAX-SAT , 2003, Canadian Conference on AI.

[13]  Pierre Hansen,et al.  Algorithms for the maximum satisfiability problem , 1987, Computing.

[14]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .