Skip to Main content Skip to Navigation
Conference papers

Conflict analysis in CP solving: Explanation generation from constraint decomposition

Abstract : The interest of Conflit-Driven Clause Learning (CDCL) [7] in SAT solving is well established. An adaptation of CDCL to Constraint Programming have been introduced in [14,15]. However, for the algorithm to run on global constraints, there is still a need to specify for each of them the explanation rules. This is a huge obstacle on its standardisation in off-the-shelf solvers. In this paper, we propose a method to automatically generate explanation rules from any constraint decomposition.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03179630
Contributor : Charles Prud'homme Connect in order to contact the contributor
Submitted on : Wednesday, March 24, 2021 - 12:34:14 PM
Last modification on : Friday, August 5, 2022 - 2:54:52 PM

File

CPTAI_2020_paper_3.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03179630, version 1

Citation

Arthur Gontier, Charlotte Truchet, Charles Prud'Homme. Conflict analysis in CP solving: Explanation generation from constraint decomposition. CP 2020: 26th International Conference on Principles and Practice of Constraint Programming: Workshop: From Constraint Programming to Trustworthy AI, Sep 2020, Louvain-la-Neuve, Belgium. ⟨hal-03179630⟩

Share

Metrics

Record views

40

Files downloads

118