论文信息 - Advances in Local Search for Satisfiability

Advances in Local Search for Satisfiability

In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+, draws on the features of two other WalkSAT family algorithms: R+AdaptNovelty+ and G2WSAT, while also successfully employing a dynamic local search (DLS) clause weighting heuristic to further improve performance. gNovelty+ was a Gold Medal winner in the random category of the 2007 SAT competition. In this paper we present a detailed description of the algorithm and extend the SAT competition results via an empirical study of the effects of problem structure and parameter tuning on the performance of gNovelty+. The study also compares gNovelty+ with two of the most representative WalkSAT-based solvers: G2WSAT, AdaptNovelty+, and two of the most representative DLS solvers: RSAPS and PAWS. Our new results augment the SAT competition results and show that gNovelty+ is also highly competitive in the domain of solving structured satisfiability problems in comparison with other SLS techniques.

Abdul Sattar | John Thornton | Duc Nghia Pham | Charles Gretton

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

[2] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.

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

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

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

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

[7] Abdul Sattar,et al. Old Resolution Meets Modern SLS , 2005, AAAI.

[8] Harry Zhang,et al. Combining Adaptive Noise and Look-Ahead in Local Search for SAT , 2007, SAT.

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

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

[11] Chu Min Li,et al. Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.

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