Skip to Main content Skip to Navigation
Conference papers

Combining VSIDS and CHB Using Restarts in SAT

Mohamed Cherif 1 Djamal Habet 1 Cyril Terrioux 1
1 COALA - COntraintes, ALgorithmes et Applications
LIS - Laboratoire d'Informatique et Systèmes
Abstract : Conflict Driven Clause Learning (CDCL) solvers are known to be efficient on structured instances and manage to solve ones with a large number of variables and clauses. An important component in such solvers is the branching heuristic which picks the next variable to branch on. In this paper, we evaluate different strategies which combine two state-of-the-art heuristics, namely the Variable State Independent Decaying Sum (VSIDS) and the Conflict History-Based (CHB) branching heuristic. These strategies take advantage of the restart mechanism, which helps to deal with the heavy-tailed phenomena in SAT, to switch between these heuristics thus ensuring a better and more diverse exploration of the search space. Our experimental evaluation shows that combining VSIDS and CHB using restarts achieves competitive results and even significantly outperforms both heuristics for some chosen strategies.
Document type :
Conference papers
Complete list of metadata

https://hal-amu.archives-ouvertes.fr/hal-03402696
Contributor : Cyril Terrioux Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 5:40:54 PM
Last modification on : Friday, October 29, 2021 - 3:58:27 AM

File

LIPIcs-CP-2021-20.pdf
Publisher files allowed on an open archive

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Mohamed Cherif, Djamal Habet, Cyril Terrioux. Combining VSIDS and CHB Using Restarts in SAT. 27th International Conference on Principles and Practice of Constraint Programming, Oct 2021, Montpellier, France. ⟨10.4230/LIPIcs.CP.2021.20⟩. ⟨hal-03402696⟩

Share

Metrics

Record views

21

Files downloads

13