An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Advances in local search for satisfiability
AI'07 Proceedings of the 20th Australian joint conference on Advances in 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
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
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
Improving PAWS by the island confinement method
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
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
Towards massively parallel local search for SAT
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
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
From sequential to parallel local search for SAT
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
Comprehensive score: towards efficient local search for SAT with long clauses
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Weight-enhanced diversification in stochastic local search for satisfiability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
This paper introduces a new SLS-solver for the satisfiability problem. It is based on the solver gNovelty+. In contrast to gNovelty+, when our solver reaches a local minimum, it computes a probability distribution on the variables from an unsatisfied clause. It then flips a variable picked according to this distribution. Compared with other state-of-the-art SLS-solvers this distribution needs neither noise nor a random walk to escape efficiently from cycles. We compared this algorithm which we called Sparrow to the winners of the SAT 2009 competition on a broad range of 3-SAT instances. Our results show that Sparrow is significantly outperforming all of its competitors on the random 3-SAT problem.