Anbulagan, AnbuPham, Duc NghiaSlaney, John KSattar, AbdulManuela VelosoSubbarao KambhampatiNeil JacobsteinBruce Porter2015-12-13July 9 200157735236Xhttp://hdl.handle.net/1885/83358Recent work on Stochastic Local Search (SLS) for the SAT and CSP domains has shown the importance of a dynamic (non-markovian) strategy for weighting clauses in order to escape from local minima. In this paper, we improve the performance of two best contemprorary clause weighting solvers, PAWS and SAPS, by integrating a prepositional resolution procedure. We also extend the work to AdaptNovelty+, the best non-weighting SLS solver in the GSAT/WalkSAT series. One outcome is that our systems can solve some highly structured problems such as quasigroup existence and parity learning problems which were previously thought unsuitable for local search and which are completely out of reach of traditional solvers such as GSAT. Here we present empirical results showing that for a range of random and real-world benchmark problems, resolution-enhanced SLS solvers clearly outperform the alternatives.Keywords: Learning systems; Markov processes; CSP domains; Learning problems; Stochastic local search (SLS); Random processes20052024-04-14