New Hybrid Heuristics for Pseudo-Boolean Propagation
arXiv:2511.21417v2
Originality Incremental advance
AI Analysis
This work addresses a specific bottleneck in pseudo-boolean solving for SAT solver developers, but it is incremental as it builds on existing hybrid methods.
The paper tackles the problem of improving unit propagation in pseudo-boolean solving by introducing new heuristics for hybrid decision-making, resulting in a drastic performance improvement over the current method in the RoundingSAT solver.
In pseudo-boolean solving the currently most successful unit propagation strategy is a hybrid mode combining the watched literal scheme with the counting method. This short paper introduces new heuristics for this hybrid decision, which are able to drastically outperform the current method in the RoundingSAT solver.