Abstract
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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Belov, A., & Stachniak, Z. (2010). Improved local search for circuit satisfiability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6175 LNCS, pp. 293–299). https://doi.org/10.1007/978-3-642-14186-7_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
