In this paper, we present efficient trap-excaping strategies in a search based on discrete Lgrange 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, par 16-1 to par 16-5, f2000, and par32-1-c to par32-3-c). Finally, we apply the same algorithm to improve on the solutions of some bench-mark MAX-SAT problems that we solved before.
展开▼
