Checking Constraint Satisfaction - Archive ouverte HAL
Article Dans Une Revue Lecture Notes in Computer Science Année : 2021

Checking Constraint Satisfaction

Résumé

We address the problem of verifying a constraint by a set of solutions S. This problem is present in almost all systems aiming at learning or acquiring constraints or constraint parameters. We propose an original approach based on MDDs. Indeed, the set of solutions can be represented by the MDD denoted by M DDS. Checking whether S satisfies a given constraint C can be done using M DD(C), the MDD that contains the set of solutions of C, and by searching if the intersection between M DD(S) and M DD(C) is equal to M DD(S). This step is equivalent to searching whether M DD(S) is included in M DD(C). Thus, we give an inclusion algorithm to speed up these calculations. Then, we generalize this approach for the computation of global constraint parameters satisfying C. Next, we introduce the notion of properties on the MDD nodes and define a new algorithm allowing to compute in only one step the set of parameters we are looking for. Finally, we present experimental results showing the interest of our approach.
Fichier principal
Vignette du fichier
checkSat.pdf (468.47 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03356093 , version 1 (27-09-2021)

Identifiants

  • HAL Id : hal-03356093 , version 1

Citer

Victor Jung, Jean-Charles Régin. Checking Constraint Satisfaction. Lecture Notes in Computer Science, 2021. ⟨hal-03356093⟩
38 Consultations
183 Téléchargements

Partager

More