Clause vivification by unit propagation in CDCL SAT solvers - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Artificial Intelligence Année : 2020

Clause vivification by unit propagation in CDCL SAT solvers

(1, 2) , (3) , , (4) , , (5)
1
2
3
4
5

Résumé

Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals. This may have a negative impact on solver performance, because redundant literals may deteriorate both the effectiveness of Boolean constraint propagation and the quality of subsequent learnt clauses. To overcome this drawback, we propose a clause vivification approach that eliminates redundant literals by applying unit propagation. The proposed clause vivification is activated before the SAT solver triggers some selected restarts, and only affects a subset of original and learnt clauses, which are considered to be more relevant according to metrics like the literal block distance (LBD). Moreover, we conducted an empirical investigation with instances coming from the hard combinatorial and application categories of recent SAT competitions. The results show that a significant number of additional instances are solved when the proposed approach is incorporated into five of the best performing CDCL SAT solvers (Glucose, TC_Glucose, COMiniSatPS, MapleCOMSPS and MapleCOMSPS_LRB). More importantly, the empirical investigation includes an in-depth analysis of the effectiveness of clause vivification. It is worth mentioning that one of the SAT solvers described here was ranked first in the main track of SAT Competition 2017 thanks to the incorporation of the proposed clause vivification. That solver was further improved in this paper and won the bronze medal in the main track of SAT Competition 2018. (C) 2019 Elsevier B.V. All rights reserved.

Dates et versions

hal-03636415 , version 1 (10-04-2022)

Identifiants

Citer

Chu-Min Li, Fan Xiao, Mao Luo, Felip Manya, Zhipeng Lu, et al.. Clause vivification by unit propagation in CDCL SAT solvers. Artificial Intelligence, 2020, 279, ⟨10.1016/j.artint.2019.103197⟩. ⟨hal-03636415⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More