Old resolution meets modern SLS
Recent 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...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of The Twentieth National Conference on Artificial Intelligence and The Seventeenth Innovative Applications of Artificial Intelligence Conference (AAAI-2005 / IAAI-2005)|
|01_Anbulagan_Old_resolution_meets_modern_2005.pdf||168.01 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.