Branching Strategy Selection Approach Based on Vivification Ratio
Mao Luo, Chu-Min Li, Xinyun Wu, Shuolin Li, Zhipeng L\"u

TL;DR
This paper introduces a new method for selecting branching strategies in SAT solvers based on vivification ratio, improving problem-solving efficiency and solving more instances from recent SAT competitions.
Contribution
A novel strategy selection approach using vivification ratio to dynamically choose between LRB and VSIDS in SAT solving.
Findings
Significantly increases the number of solved instances.
Robust approach effective on recent SAT competition benchmarks.
Enables Maple_CM to solve 16+ more instances from 2020 SAT benchmark.
Abstract
The two most effective branching strategies LRB and VSIDS perform differently on different types of instances. Generally, LRB is more effective on crafted instances, while VSIDS is more effective on application ones. However, distinguishing the types of instances is difficult. To overcome this drawback, we propose a branching strategy selection approach based on the vivification ratio. This approach uses the LRB branching strategy more to solve the instances with a very low vivification ratio. We tested the instances from the main track of SAT competitions in recent years. The results show that the proposed approach is robust and it significantly increases the number of solved instances. It is worth mentioning that, with the help of our approach, the solver Maple\_CM can solve more than 16 instances for the benchmark from the 2020 SAT competition.
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
TopicsSoftware Testing and Debugging Techniques · Advanced Database Systems and Queries · Cloud Computing and Resource Management
