Circuit-based Boolean Reasoning
Proceedings of the 38th annual Design Automation Conference
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Justification-Based Non-Clausal Local Search for SAT
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Building structure into local search for SAT
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Stochastic local search for non-clausal and circuit satisfiability
Stochastic local search for non-clausal and circuit satisfiability
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
Off the trail: re-examining the CDCL algorithm
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
On the violation of circuits in decomposable negation normal form
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
| Hi-index | 0.00 |
In this paper we describe a significant improvement to the justificationbased local search algorithm for circuit satisfiability proposed by Järvisalo et al [7]. By carefully combining local search with Boolean Constraint Propagation we achieve multiple orders of magnitude reduction in run-time on industrial and structured benchmark circuits, and, in some cases, performance comparable with complete SAT solvers.