gNovelty+ (v. 2)

We describe an enhanced version of gNovelty+ [Pham et al., 2008], a stochastic local search (SLS) procedure for finding satisfying models of satisfable propositional CNF formulae. Version 1 of gNovelty+ was a Gold Medal winner in the random category of the 2007 SAT competition. In this version 2, we implemented an explicit mechanism to handle implications derived from binary clauses. We also made this version of gNovelty+ multithreaded. This abstract is organised as follows: we provide an overview of gNovelty+ and then describe the new enhancements added to this new version. Finally, we describe the technical settings of its contest implementation.