A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Integration of supercubing and learning in a SAT solver
Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.
Learning is an essential pruning technique in modern SAT solvers, but it exploits a relatively small amount of information that can be deduced from the conflicts. Recently a new pruning technique called supercubing was proposed [1]. Supercubing can exploit functional symmetries that are abundant in industrial SAT instances. We point out the significant difficulties of integrating supercubing with learning and propose solutions. Our experimental solver is the first supercubing-based solver with performance comparable to leading edge solvers.
doi:10.1109/aspdac.2005.1466203
fatcat:63casbvjjbbndgwq247eoj72vy