Combining VSIDS and CHB Using Restarts in SAT - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Combining VSIDS and CHB Using Restarts in SAT

(1) , (1) , (1)
1

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.
Fichier principal
Vignette du fichier
LIPIcs-CP-2021-20.pdf (1.12 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03402696 , version 1 (25-10-2021)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Mohamed Sami 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⟩
76 View
104 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More