Revisiting the Learned Clauses Database Reduction Strategies - Université d'Artois
Article Dans Une Revue International Journal on Artificial Intelligence Tools Année : 2018

Revisiting the Learned Clauses Database Reduction Strategies

Résumé

In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned clauses database management policies. Our motivation takes its source from a simple observation on the remarkable performances of both random and size-bounded reduction strategies. We first derive a simple reduction strategy, called Size-Bounded Randomized strategy (in short SBR), that combines maintaining short clauses (of size bounded by k), while deleting randomly clauses of size greater than k. The resulting strategy outperform the state-of-the-art on SAT instances taken from the SAT competitions 2013 and 2018, and remains competitive on a broad range of SAT instances of the SAT Competition 2014. Reinforced by the interest of keeping short clauses, we propose several new dynamic variants, and we discuss their performance. We also propose different ways for adjusting dynamically the size-bounded parameter of the strategy.

Dates et versions

hal-04506635 , version 1 (15-03-2024)

Identifiants

Citer

Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Yakoub Salhi. Revisiting the Learned Clauses Database Reduction Strategies. International Journal on Artificial Intelligence Tools, 2018, 27 (08), pp.1850033. ⟨10.1142/S0218213018500331⟩. ⟨hal-04506635⟩
14 Consultations
0 Téléchargements

Altmetric

Partager

More