On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
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
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
A composite-neighborhood tabu search approach to the traveling tournament problem
Journal of Heuristics
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Predicting learnt clauses quality in modern SAT solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
Towards an understanding of hill-climbing procedures for SAT
AAAI'93 Proceedings of the eleventh national conference on 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
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
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
EagleUP: solving random 3-SAT using SLS with unit propagation
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Local Search with Configuration Checking for SAT
ICTAI '11 Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Improving stochastic local search for SAT with a new probability distribution
SAT'10 Proceedings of the 13th international conference on Theory and Applications 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
An empirical study of optimal noise and runtime distributions in local search
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Choosing probability distributions for stochastic local search and the role of make versus break
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Satisfying versus falsifying in local search for satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Exploiting historical relationships of clauses and variables in local search for satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
This paper presents and analyzes two new efficient local search strategies for the Boolean Satisfiability (SAT) problem. We start by proposing a local search strategy called configuration checking (CC) for SAT. The CC strategy results in a simple local search algorithm for SAT called Swcc, which shows promising experimental results on random 3-SAT instances, and outperforms TNM, the winner of SAT Competition 2009. However, the CC strategy for SAT is still in a nascent stage, and Swcc cannot yet compete with Sparrow2011, which won SAT Competition 2011 just after Swcc had been designed. The CC strategy seems too strict in that it forbids flipping those variables even with great scores, if they do not satisfy the CC criterion. We improve the CC strategy by adopting an aspiration mechanism, and get a new variable selection heuristic called configuration checking with aspiration (CCA). The CCA heuristic leads to an improved algorithm called Swcca, which exhibits state-of-the-art performance on random 3-SAT instances and crafted ones. The third contribution concerns improving local search algorithms for random k-SAT instances with k3. Although the SAT community has made great achievements in solving random 3-SAT instances, the progress lags far behind on random k-SAT instances with k3. This work proposes a new variable property called subscore, which is utilized to break ties in the CCA heuristic when candidate variables for flipping have the same score. The resulting algorithm CCAsubscore is very efficient for solving random k-SAT instances with k3, and significantly outperforms other state-of-the-art ones. Combining Swcca and CCAsubscore, we obtain a local search SAT solver called CCASat, which was ranked first in the random track of SAT Challenge 2012. Additionally, we perform theoretical analyses on the CC strategy and the subscore property, and show interesting results on these two heuristics. Particularly, our analysis indicates that the CC strategy is more effective for k-SAT with smaller k, while the subscore notion is not suitable for solving random 3-SAT.