Formally Verified Transformation of Non-binary Constraints into Binary Constraints

09/01/2020
by   Catherine Dubois, et al.
0

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 well-known 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/26/2011

Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results

A non-binary Constraint Satisfaction Problem (CSP) can be solved directl...
03/26/2020

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...
03/02/2010

A new model for solution of complex distributed constrained problems

In this paper we describe an original computational model for solving di...
12/21/2018

Solution Dominance over Constraint Satisfaction Problems

Constraint Satisfaction Problems (CSPs) typically have many solutions th...
01/31/2020

Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products

We study the design of stochastic local search methods to prove unsatisf...
10/10/2018

Trapezoidal Generalization over Linear Constraints

We are developing a model-based fuzzing framework that employs mathemati...
04/05/2013

Pattern-Based Constraint Satisfaction and Logic Puzzles

Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.