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

Compressing UNSAT CDCL Trees with Caching

Résumé

We aim at providing users of SAT solvers with small, easily understandable proofs of unsatisfiability. Caching techniques have been proposed to identify redundant subproofs and reduce the size of some UNSAT proof trees. Branches are pruned when they correspond to subformulas that were proved unsatisfiable earlier in the tree. A caching mechanism based on subgraph isomorphism was proposed as postprocessing step both in the DPLL and CDCL architectures but the technique could only be integrated during the search on the DPLL architecture. This paper presents how to integrate such caching mechanism during the search for the CDCL case and presents a generalized caching mechanism for that architecture.
Fichier principal
Vignette du fichier
cache-cdcl-paper.pdf (503.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04486327 , version 1 (01-03-2024)

Identifiants

Citer

Anthony Blomme, Daniel Berre, Anne Parrain, Olivier Roussel. Compressing UNSAT CDCL Trees with Caching. ICAART 2024: 16th International Conference on Agents and Artificial Intelligence, Feb 2024, Rome, Italy. pp.792-799, ⟨10.5220/0012393000003636⟩. ⟨hal-04486327⟩
6 Consultations
16 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More