Conflict analysis in CP solving: Explanation generation from constraint decomposition - Archive ouverte HAL Access content directly
Conference Papers Year :

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.
Fichier principal
Vignette du fichier
CPTAI_2020_paper_3.pdf (295.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03179630 , version 1 (24-03-2021)

Identifiers

  • HAL Id : hal-03179630 , version 1

Cite

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⟩
56 View
169 Download

Share

Gmail Facebook Twitter LinkedIn More