Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
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
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
Journal of Automated Reasoning
An algorithm based on tabu search for satisfiability problem
Journal of Computer Science and Technology
Towards Fewer Parameters for SAT Clause Weighting Algorithms
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
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
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
SAT problems with chains of dependent variables
Discrete Applied Mathematics - The renesse issue on satisfiability
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Performance test of local search algorithms using new types of random CNF formulas
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Backbone guided local search for maximum satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The exponentiated subgradient algorithm for heuristic Boolean programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Iterated robust tabu search for MAX-SAT
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Scaling and probabilistic smoothing: dynamic local search for unweighted MAX-SAT
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Towards an understanding of hill-climbing procedures for SAT
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
The breakout method for escaping from local minima
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Variable-selection heuristics in local search for SAT
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
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
Weighting for godot: learning heuristics for GSAT
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
Boosting Haplotype Inference with Local Search
Constraints
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
Tuning Local Search by Average-Reward Reinforcement Learning
Learning and Intelligent Optimization
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
Combining finite learning automata with GSAT for the satisfiability problem
Engineering Applications of Artificial Intelligence
Captain Jack: new variable selection heuristics in local search for SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
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
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
From sequential to parallel local search for SAT
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Weight-enhanced diversification in stochastic local search for satisfiability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for long periods in deep local minima. Clause weighting algorithms such as DLM, GLS, ESG and SAPS are good at escaping local minima but require expensive smoothing phases in which all weights are updated. We show that Walksat performance can be greatly enhanced by weighting variables instead of clauses, giving the best known results on some benchmarks. The new algorithm uses an efficient weight smoothing technique with no smoothing phase.