Sciweavers

CP
2005
Springer

Lookahead Saturation with Restriction for SAT

14 years 4 months ago
Lookahead Saturation with Restriction for SAT
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report on the integration of this heuristic in Satz, a high-performance SAT solver, showing empirically that it significantly improves the performance on an extensive range of benchmark problems that exhibit hard structure.
Anbulagan, John K. Slaney
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where CP
Authors Anbulagan, John K. Slaney
Comments (0)