On the power of top-k undominated learnt clauses for Modern SAT Solvers - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

On the power of top-k undominated learnt clauses for Modern SAT Solvers

Résumé

Clause Learning is one of the most important components of a conflict driven clause learning (CDCL) SAT solver that is effective on industrial instances. Since the number of learned clauses is proved to be exponential in the worse case, it is necessary to identify the most relevant clauses to maintain and delete the irrelevant ones. As reported in the literature, several learned clauses deletion strategies have been proposed. However the diversity in both the number of clauses to be removed at each step of reduction and the results obtained with each strategy increase the difficulty to determine which criterion is better. Thus, the problem to select which learned clauses are to be removed during the search step remains very challenging. In this paper, we propose a novel approach to identify the most relevant learned clauses without favoring or excluding any of the proposed measures, but by adopting the notion of dominance relationship among those measures. Our approach bypasses the problem of results diversity and reaches a compromise between the measures assessments. Furthermore, the proposed approach also avoids another non-trivial problem which is the number of deleted clauses at each reduction of the learned clause database.
Fichier principal
Vignette du fichier
Lonlac_and_Mephu_2017.pdf (484.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01616563 , version 1 (13-10-2017)

Identifiants

Citer

Jerry Lonlac, Engelbert Mephu Nguifo. On the power of top-k undominated learnt clauses for Modern SAT Solvers. 2017. ⟨hal-01616563⟩
234 Consultations
133 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More