Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

@article{Mills2004GuidedLS,
  title={Guided Local Search for Solving SAT and Weighted MAX-SAT Problems},
  author={Patrick Mills and Edward P. K. Tsang},
  journal={Journal of Automated Reasoning},
  year={2004},
  volume={24},
  pages={205-223}
}
  • P. Mills, E. Tsang
  • Published 2004
  • Mathematics, Computer Science
  • Journal of Automated Reasoning
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT problem. GLS is a general, penalty-based meta-heuristic, which sits on top of local search algorithms to help guide them out of local minima. GLS has been shown to be successful in solving a number of practical real-life problems, such as the traveling salesman problem, BT"s workforce scheduling problem, the radio… Expand
Iterated Robust Tabu Search for MAX-SAT
TLDR
This paper presents a new stochastic local search (SLS) algorithm for MAX-SAT that combines Iterated Local Search and Tabu Search, two well-known SLS methods that have been successfully applied to many other combinatorial optimisation problems. Expand
Stochastic local search for Partial Max-SAT: an experimental evaluation
TLDR
The results of this evaluation study show that the currently best performing SLS methods for the PMSAT problem fall into three categories: distinction- based, configuration checking-based, and dynamic local search methods. Expand
CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
TLDR
Experimental results illustrate that the quality of solution found by CCLS is much better than that found by IRoTS, akmaxsat_ls and New WPM2 on most industrial, crafted and random instances, indicating the efficiency and the robustness of the CCRS algorithm. Expand
Global Equilibrium Search Algorithms for Combinatorial Optimization Problems
TLDR
This talk provides an overview of Global Equilibrium Search, a meta-heuristic framework that shares similar ideas with the simulated annealing method, and discusses some successful applications. Expand
Local search starting from an LP solution: Fast and quite good
TLDR
This work presents and evaluates a specific way to generate good start solutions for local search whose objective values are not too far from the best solutions from repeated random starts. Expand
SOLVING THE WEIGHTED MAX-2-SAT PROBLEM WITH ITERATED TABU SEARCH
Given a CNF formula in which each clause is of length at most two and has an associated positive weight, the weighted Max-2-SAT problem asks to find a truth assignment to the Boolean variables thatExpand
Backbone Guided Local Search for the Weighted Maximum Satisfiability Problem
The Satisfiability problem (SAT) is a famous NP-Complete problem, which consists of an assignment of Boolean variables (true or false) and some clauses formed of these variables. A clause is aExpand
A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems
TLDR
A variable neighborhood walksat-based algorithm that can be combined easily using any local search algorithm and its effectiveness is compared with existing algorithms using 1-flip neighborhood structure and solvers such as CCLS and Optimax from the eighth MAX-SAT evaluation. Expand
Solving the weighted MAX-SAT problem using the dynamic convexized method
TLDR
This paper investigates the performance of the dynamic convexized method based heuristics on the weighted MAX-SAT problem and presents an auxiliary function which is constructed based on a penalty function, and a local search method which can escape successfully from previously converged local minimizers. Expand
Insect Swarm Algorithms for Dynamic MAX-SAT Problems
TLDR
This chapter studies the application to dynamic MAX-SAT of the swarm based metaheuristics ant colony optimization and wasp swarm optimization algorithms, which are based in the real life behavior of ants and wasps, respectively. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 82 REFERENCES
Discrete Lagrangian-Based Search for Solving MAX-SAT Problems
TLDR
This paper compares DLM with GRASP in solving a large set of test problems, and shows that it nds better solutions and is substantially faster. Expand
Guided local search and its application to the traveling salesman problem
TLDR
Comparisons are made with some of the best TSP heuristic algorithms and general optimization techniques which demonstrate the advantages of GLS over alternative heuristic approaches suggested for the problem. Expand
Local search for satisfiability (SAT) problem
  • J. Gu
  • Mathematics, Computer Science
  • IEEE Trans. Syst. Man Cybern.
  • 1993
TLDR
The author shows how to use the local search techniques to solve the satisfiability problem and indicates that the localsearch algorithms are much more efficient than the existing SAT algorithms for certain classes of conjunctive normal form (CNF) formulas. Expand
Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT
Stochastic local search is an effective technique for solving certain classes of large, hard propositional satisfiability problems, including propositional encodings of problems such as circuitExpand
Local Search for Satissability (sat) Problem
The satissability problem (SAT) is a fundamental problem in mathematical logic, constraint satisfaction , VLSI engineering, and computing theory. Methods to solve the satissability problem play anExpand
Improving the performance of discrete Lagrange-multiplier search for solving hard SAT problems
  • Yi Shang, B. Wah
  • Computer Science
  • Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294)
  • 1998
TLDR
It is shown that DLM can perform better than competing local-search methods when its parameters are selected properly, and the importance of dynamic scaling of Lagrange multipliers and the flat-move strategy is shown. Expand
Global Optimization for Satisfiability (SAT) Problem
  • J. Gu
  • Computer Science
  • IEEE Trans. Knowl. Data Eng.
  • 1994
TLDR
The Universal SAT problem model, UniSAT, is introduced, which transforms the discrete SAT problem on Boolean space {0, 1}/Sup m/ into an unconstrained global optimization problem on real space E/sup m/ and establishes a direct correspondence between the solution of the SAT problem and the global minimum point of the UniSat objective function. Expand
A New Method for Solving Hard Satisfiability Problems
TLDR
A greedy local search procedure called GSAT is introduced for solving propositional satisfiability problems and its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks. Expand
Look-Ahead Versus Look-Back for Satisfiability Problems
TLDR
A very simple DPL procedure called Satz is proposed which only employs some look-ahead techniques: a variable ordering heuristic, a forward consistency checking (Unit Propagation) and a limited resolution before the search, where the heuristic is itself based on unit propagation. Expand
Approximate solution of weighted MAX-SAT problems using GRASP
TLDR
A greedy randomized adaptive search procedure (GRASP) for computing approximate solutions of weighted MAX-SAT problems and computational experience indicates the suitability of GRASP for this class of problems. Expand
...
1
2
3
4
5
...