Compressing UNSAT Search Trees with Caching - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Compressing UNSAT Search Trees with Caching

Résumé

In order to provide users of SAT solvers with small, easily understandable proofs of unsatisfiability, we present caching techniques to identify redundant subproofs and reduce the size of some UNSAT proof trees. In a search tree, we prune branches corresponding to subformulas that were proved unsatisfiable earlier in the tree. To do so, we use a cache inspired by model counters and we adapt it to the case of unsatisfiable formulas. The implementation of this cache in a CDCL and a DPLL solver is discussed. This approach can drastically reduce the UNSAT proof tree of several benchmarks from the SAT'02 and SAT'03 competitions.

Mots clés

Fichier principal
Vignette du fichier
cache-paper.pdf (263.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04015616 , version 1 (06-03-2023)

Identifiants

Citer

Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel. Compressing UNSAT Search Trees with Caching. ICAART 2023 : 15th International Conference on Agents and Artificial Intelligence, Feb 2023, Lisbonne, Portugal. pp.358-365, ⟨10.5220/0011671800003393⟩. ⟨hal-04015616⟩
54 Consultations
131 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More