Weight Redistribution for Unweighted MAX-SAT

Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes theMAX-SAT problem an important area of research for the satisfiability (SAT) community. In this study we perform an empirical analysis of several of the best performing SAT local search techniques in the domain of unweighted MAX-SAT. In particular, we test two of the most recently developed SAT clause weight redistribution algorithms, DDFW and DDFW+, against three more well-known techniques (RSAPS, AdaptNovelty+ and PAWS). Based on an empirical study across a range of previously studied problems we conclude that DDFW is the most promising algorithm in terms of robust average performance.

[1]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[2]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[3]  John Thornton,et al.  Clause Weighting Local Search for SAT , 2005, Journal of Automated Reasoning.

[4]  Holger H. Hoos,et al.  Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT , 2003, Canadian Conference on AI.

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

[6]  Edward P. K. Tsang,et al.  Guided Local Search for Solving SAT and Weighted MAX-SAT Problems , 2000, Journal of Automated Reasoning.

[7]  Byungki Cha,et al.  Local Search Algorithms for Partial MAXSAT , 1997, AAAI/IAAI.

[8]  Toshihide Ibaraki,et al.  Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT , 1999, J. Comb. Optim..

[9]  Kevin Leyton-Brown,et al.  Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms , 2006, CP.

[10]  Abdul Sattar,et al.  Adaptive Clause Weight Redistribution , 2006, CP.

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

[12]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

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

[14]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..