Compressing UNSAT CDCL Trees with Caching

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

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Compressing UNSAT CDCL Trees with Caching

Topics: Constraint Satisfaction; Explainable Artificial Intelligence

In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART, 792-799, 2024 , Rome, Italy

Authors: Anthony Blomme ; Daniel Le Berre ; Anne Parrain and Olivier Roussel

Affiliation: Univ. Artois, CNRS, Centre de Recherche en Informatique de Lens (CRIL), F-62300 Lens, France

Keyword(s): Explainable AI, SAT Solver, Proof Compression.

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.216.32.116

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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; ISSN 2184-433X, SciTePress, pages 792-799. DOI: 10.5220/0012393000003636

@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},
issn={2184-433X},
}

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
IS - 2184-433X
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