On the run-time behaviour of stochastic local search algorithms for SAT
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A machine program for theorem-proving
Communications of the ACM
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Clause Weighting Local Search for SAT
Journal of Automated Reasoning
Old resolution meets modern SLS
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Using Cost Distributions to Guide Weight Decay in Local Search for SAT
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Reinforcement Learning and Reactive Search: an adaptive MAX-SAT solver
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Efficiently exploiting dependencies in local search for SAT
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Towards industrial-like random SAT instances
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
sgen1: A generator of small but difficult satisfiability benchmarks
Journal of Experimental Algorithmics (JEA)
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
Improving stochastic local search for SAT with a new probability distribution
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
International Journal of Advanced Intelligence Paradigms
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.01 |
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.