Weak-commitment search for solving constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A machine program for theorem-proving
Communications of the ACM
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
Nonsystematic Search and No-Good Learning
Journal of Automated Reasoning
Local Search with Constraint Propagation and Conflict-Based Heuristics
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Speeding-up non-clausal local search for propositional satisfiability with clause learning
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Automatic extraction of functional dependencies
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Stochastic local search for SMT: combining theory solvers with WalkSAT
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Improved local search for circuit satisfiability
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Depth-driven circuit-level stochastic local search for SAT
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Towards a population-based framework for improving stochastic local search algorithms
Proceedings of the 14th annual conference on Genetic and evolutionary computation
On the violation of circuits in decomposable negation normal form
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
This paper considers two methods for speeding-up stochastic local search SAT procedures. The first method aims at using the search history (represented by additional formulas derived at every state of the search process) to constrain the selection of candidate variables used to navigate through the search space of truth-value assignments. The second method uses the search history to allow multiple modifications of the current truth-value assignment in a single search step. Empirical studies of these two methods have demonstrated their effectiveness on structured and industrial SAT instances.