Improving Constraint Satisfaction Algorithm Efficiency for the AllDifferent Constraint

12/07/2020
by   Geoff Harris, et al.
0

Combinatorial problems stated as Constraint Satisfaction Problems (CSP) are examined. It is shown by example that any algorithm designed for the original CSP, and involving the AllDifferent constraint, has at least the same level of efficacy when simultaneously applied to both the original and its complementary problem. The 1-to-1 mapping employed to transform a CSP to its complementary problem, which is also a CSP, is introduced. This "Dual CSP" method and its application are outlined. The analysis of several random problem instances demonstrate the benefits of this method for variable domain reduction compared to the standard approach to CSP. Extensions to additional constraints other than AllDifferent, as well as the use of hybrid algorithms, are proposed as candidates for this Dual CSP method.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/25/2017

A new algorithm for constraint satisfaction problems with Maltsev templates

In this article, we provide a new algorithm for solving constraint satis...
01/15/2014

Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms

A weighted constraint satisfaction problem (WCSP) is a constraint satisf...
02/27/2013

Probabilistic Constraint Satisfaction with Non-Gaussian Noise

We have previously reported a Bayesian algorithm for determining the coo...
11/17/2011

Unbiased Statistics of a CSP - A Controlled-Bias Generator

We show that estimating the complexity (mean and distribution) of the in...
01/31/2020

Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products

We study the design of stochastic local search methods to prove unsatisf...
08/16/2019

Exploring Properties of Icosoku by Constraint Satisfaction Approach

Icosoku is a challenging and interesting puzzle that exhibits highly sym...
10/09/2011

Confidence-based Reasoning in Stochastic Constraint Programming

In this work we introduce a novel approach, based on sampling, for findi...
This week in AI

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