New Hybrid Heuristics for Pseudo-Boolean Propagation
Mia M\"u{\ss}ig, Jan Johannsen

TL;DR
This paper introduces new heuristics for pseudo-boolean propagation that significantly improve performance in the RoundingSAT solver by enhancing the hybrid unit propagation strategy.
Contribution
It presents novel heuristics for hybrid pseudo-boolean propagation that outperform existing methods in a leading solver.
Findings
Heuristics drastically improve propagation efficiency.
Performance gains demonstrated in RoundingSAT solver.
Enhanced heuristics outperform current hybrid methods.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Formal Methods in Verification · Error Correcting Code Techniques
