Tabu Search for SAT
نویسندگان
چکیده
In this paper tabu search for SAT is investi gated from an experimental point of view To this end TSAT a basic tabu search algorithm for SAT is introduced and compared with Selman et al Random Walk Strategy GSAT procedure in short RWS GSAT TSAT does not involve the ad ditional stochastic process of RWS GSAT This should facilitate the understanding of why simple local search methods for SAT work It is shown that the length of the tabu list plays a critical role in the performance of the algorithm More over surprising properties about the experimen tal optimal length of the tabu list are exhibited raising interesting issues about the nature of hard random SAT problems
منابع مشابه
Tabu Search vs. Random Walk
We investigate the beneet of Tabu Search for satissability (SAT) and constraint satisfaction problems (CSP) and compare it to the more frequently used random walk heuristic. We argue, that a more deterministic direction of search as done with Tabu Search is worth considering also for SAT and CSP. We give experimental evidence that Tabu Search can be used to eeciently guide local search procedur...
متن کاملA Scatter Search Variant to Solve max-SAT Problems
In this work, a new scatter search-based approach is studied for the NP-Hard satisfiability problems, in particular for its optimization version namely max-SAT. The paper describes a scatter search algorithm enhanced with a tabu search component combined with a uniform crossover operator. The latter is used to identify promising search regions while tabu search performs an intensified search of...
متن کاملOn the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the art in performance for universal (i.e. non specialized solvers) seems to be variants of Simulated Annealing (SA) and MaxWalkSat (MWS), stochastic local search methods. Local search methods are conceptually simple, and ...
متن کاملSystem Description: CRIL Platform for SAT
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satissability. Most notably, it features an optimized tabu-based local search method and includes a powerful logically complete approach that combines the respective strengths of local and systematic search techniques. This platf...
متن کاملMAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over local search alone has been already shown experimentally several times. A natural question addressed here is to understand if this superiority holds also from the worst-case point of view. Moreover, it is well known that a critic...
متن کامل