Backbone Guided Local Search for Maximum Satisfiability

Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of the best local search algorithms designed for SAT, on Max-SAT. We show that Walksat is also effective on Max-SAT, while its effectiveness degrades as the problem is more constrained. We then develop a novel method that exploits the backbone information in the local minima from Walksat and applies the backbone information in different ways to improve the performance of the Walksat algorithm. We call our new algorithm backbone guided Walksat (BGWalksat). On large random SAT and Max-SAT problems as well as instances from the SATLIB, BGWalksat significantly improves Walksat's performance.

[1]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

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

[3]  Gilles Dequen,et al.  A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.

[4]  Toby Walsh,et al.  Backbones in Optimization and Approximation , 2001, IJCAI.

[5]  Weixiong Zhang,et al.  Epsilon-Transformation: Exploiting Phase Transitions to Solve Combinatorial Optimization Problems Initial Results , 1994, AAAI.

[6]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

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

[8]  Henry A. Kautz,et al.  Auto-Walksat: A Self-Tuning Implementation of Walksat , 2001, Electron. Notes Discret. Math..

[9]  Henry A. Kautz,et al.  Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT , 1995 .

[10]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[11]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[12]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[13]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[14]  Henry Kautz,et al.  Noise Strategies for Local Search , 1994, AAAI 1994.

[15]  Weixiong Zhang,et al.  Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT , 2001, CP.

[16]  Kenneth Dean Boese,et al.  Models for iterative global optimization , 1996 .