Compressing UNSAT CDCL Trees with Caching

Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel

2024

Abstract

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.

Paper Citation

in Harvard Style

Blomme A., Le Berre D., Parrain A. and Roussel O. (2024). Compressing UNSAT CDCL Trees with Caching. In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART; ISBN 978-989-758-680-4, SciTePress, pages 792-799. DOI: 10.5220/0012393000003636

in Bibtex Style

@conference{icaart24,
author={Anthony Blomme and Daniel Le Berre and Anne Parrain and Olivier Roussel},
title={Compressing UNSAT CDCL Trees with Caching},
booktitle={Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART},
year={2024},
pages={792-799},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012393000003636},
isbn={978-989-758-680-4},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART
TI - Compressing UNSAT CDCL Trees with Caching
SN - 978-989-758-680-4
AU - Blomme A.
AU - Le Berre D.
AU - Parrain A.
AU - Roussel O.
PY - 2024
SP - 792
EP - 799
DO - 10.5220/0012393000003636
PB - SciTePress