Assignment stack shrinking is a technique that is intended to speed up the performance of modern complete SAT solvers. Shrinking was shown to be efficient in SAT'04 competition winners Jerusat and Chaff. However, existing studies lack the details of the shrinking algorithm. In addition, shrinking's performance was not tested in conjunction with the most modern techniques. This paper provides a detailed description of the shrinking algorithm and proposes two new heursitics for it. We show that using shrinking is critical for solving well-known industrial benchmark families with the latest versions of Minisat and Eureka. © 2010 Springer-Verlag.
CITATION STYLE
Nadel, A., & Ryvchin, V. (2010). Assignment stack shrinking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6175 LNCS, pp. 375–381). https://doi.org/10.1007/978-3-642-14186-7_35
Mendeley helps you to discover research relevant for your work.