.png){kind=icon}
Return
Improving SAT Solver Performance with Structure-based Preferential Bumping
.png){kind=icon}
OA
AI
DOI：10.29007/3pxg.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a method we call structure-based preferential bumping,as a low-cost way to exploit formula structure in VSIDS-based SAT solvers.We show that the Glucose SAT solver, when modified with preferential bumpingof certain easily identified structurally important variables,out-performs unmodified Glucose on the industrial formulasfrom recent SAT solver competitions.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available