Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems
Journal of Global Optimization
Local search characteristics of incomplete SAT procedures
Artificial Intelligence
Towards Fewer Parameters for SAT Clause Weighting Algorithms
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Reducing search space in local search for constraint satisfaction
Eighteenth national conference on Artificial intelligence
Automated discovery of composite SAT variable-selection heuristics
Eighteenth national conference on Artificial intelligence
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Discrete Applied Mathematics
AIKED'05 Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
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
Boosting learning and inference in Markov logic through metaheuristics
Applied Intelligence
Constraint metrics for local search
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Longer-Term memory in clause weighting local search for SAT
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Improving PAWS by the island confinement method
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
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
International Journal of Advanced Intelligence Paradigms
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.00 |
In this paper, we present efficient trap-escaping strategies in a search based on discrete Lagrange multipliers to solve difficult SAT problems. Although a basic discrete Lagrangian method (DLM) can solve most of the satisfiable DIMACS SAT benchmarks efficiently, a few of the large benchmarks have eluded solutions by any local-search methods today. These difficult benchmarks generally have many traps that attract localsearch trajectories. To this end, we identify the existence of traps when any change to a variable will cause the resulting Lagrangian value to increase. Using the hanoi4 and par16-1 benchmarks, we illustrate that some unsatisfied clauses are trapped more often than others. Since it is too difficult to remember explicitly all the traps encountered, we propose to remember these traps implicitly by giving larger increases to Lagrange multipliers of unsatisfied clauses that are trapped more often. We illustrate the merit of this new update strategy by solving some of most difficult but satisfiable SAT benchmarks in the DIMACS archive (hanoi4, hanoi4-simple, par16-1 to par16-5, f2000, and par32-1-c to par32-3-c). Finally, we apply the same algorithm to improve on the solutions of some benchmark MAX-SAT problems that we solved before.