Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
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
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
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
Artificial Intelligence
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
Local Search Characteristics of Incomplete SAT Procedures
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
When gravity fails: local search topology
Journal of Artificial Intelligence Research
The exponentiated subgradient algorithm for heuristic Boolean programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
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
Tuning local search for satisfiability testing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
Clause Weighting Local Search for SAT
Journal of Automated Reasoning
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Justification-Based Local Search with Adaptive Noise Strategies
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Justification-Based Non-Clausal Local Search for SAT
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
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
Problem-Sensitive Restart Heuristics for the DPLL Procedure
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Old resolution meets modern SLS
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Generation of hard non-clausal random satisfiability problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Efficiently exploiting dependencies in local search for SAT
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Building structure into local search for SAT
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Backbone guided local search for maximum satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Relaxed survey propagation for the weighted maximum satisfiability problem
Journal of Artificial Intelligence Research
Combining adaptive noise and look-ahead in local search for SAT
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Advances in local search for satisfiability
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Weight redistribution for unweighted MAX-SAT
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Adaptive restart strategies for conflict driven SAT solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Improvements to hybrid incremental SAT algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Speeding-up non-clausal local search for propositional satisfiability with clause learning
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Combining finite learning automata with GSAT for the satisfiability problem
Engineering Applications of Artificial Intelligence
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Self Controlling Tabu Search algorithm for the Quadratic Assignment Problem
Computers and Industrial Engineering
Journal of Automated Reasoning
A CSP solver focusing on FAC variables
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
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
Adaptive clause weight redistribution
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Threshold behaviour of WalkSAT and focused metropolis search on random 3-satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
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
On the quality and quantity of random decisions in stochastic local search for SAT
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Improving parallel local search for SAT
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
Choosing probability distributions for stochastic local search and the role of make versus break
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Satisfying versus falsifying in local search for satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Exploiting historical relationships of clauses and variables in local search for satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Lower bounds and upper bounds for MaxSAT
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
Stochastic Learning for SAT-Encoded Graph Coloring Problems
International Journal of Applied Metaheuristic Computing
A method to avoid duplicative flipping in local search for SAT
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
| Hi-index | 0.00 |
Stochastic local search algorithms based on the WalkSAT architecture are among the best known methods for solving hard and large instances of the propositional satisfiability problem (SAT). The performance and behaviour of these algorithms critically depends on the setting of the noise parameter, which controls the greediness of the search process. The optimal setting for the noise parameter varies considerably between different types and sizes of problem instances; consequently, considerable manual tuning is typically required to obtain peak performance. In this paper, we characterise the impact of the noise setting on the behaviour of WalkSAT and introduce a simple adaptive noise mechanism for WalkSAT that does not require manual adjustment for different problem instances. We present experimental results indicating that by using this self-tuning noise mechanism, various WalkSAT variants (including WalkSAT/SKC and Novelty+) achieve performance levels close to their peak performance for instance-specific, manually tuned noise settings.