Formally verified transformation of non-binary constraints into binary constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Formally verified transformation of non-binary constraints into binary constraints

Résumé

It is well known in the Constraint Programming community that any non-binary constraint satisfaction problem (with finite domains) can be transformed into an equivalent binary one. One of the most wellknown translations is the Hidden Variable Encoding. In this paper we formalize this encoding in the proof assistant Coq and prove that any solution of the binary constraint satisfaction problem makes it possible to build a solution of the original problem and vice-versa. This formal development is used to complete the formally verified constraint solver developed in Coq by Carlier, Dubois and Gotlieb in 2012, making it a tool able to solve any n-ary constraint satisfaction problem, The key of success of the connection between the translator and the Coq binary solver is the genericity of the latter.
Fichier principal
Vignette du fichier
wflp2020_final.pdf (367.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04330062 , version 1 (07-12-2023)

Identifiants

Citer

Catherine Dubois. Formally verified transformation of non-binary constraints into binary constraints. International Workshop on Functional and Constraint Logic Programming (WFLP), Sep 2020, Bologna, Italy. pp.117-128, ⟨10.1007/978-3-030-75333-7_7⟩. ⟨hal-04330062⟩
9 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More