Combining Adaptive and Dynamic Local Search for Satisfiability

In this paper we describe a stochastic local search (SLS) procedure for flnding models of satisflable propositional formulae. This new algorithm, gNovelty + , draws on the features of two other WalkSAT family algorithms: AdaptNovelty + and G 2 WSAT, while also successfully employing a hybrid clause weighting heuristic based on the features of two dynamic local search (DLS) algorithms: PAWS and (R)SAPS. 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 efiects of problem structure, parameter tuning and resolution preprocessors on the performance of gNovelty + . The study compares gNovelty + with three of the most representative WalkSAT-based solvers: AdaptG 2 WSAT0, G 2 WSAT and 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 satisflability problems in comparison with other SLS techniques.