Short and Long Supports for Constraint Propagation

by   Peter Nightingale, et al.

Special-purpose constraint propagation algorithms frequently make implicit use of short supports -- by examining a subset of the variables, they can infer support (a justification that a variable-value pair may still form part of an assignment that satisfies the constraint) for all other variables and values and save substantial work -- but short supports have not been studied in their own right. The two main contributions of this paper are the identification of short supports as important for constraint propagation, and the introduction of HaggisGAC, an efficient and effective general purpose propagation algorithm for exploiting short supports. Given the complexity of HaggisGAC, we present it as an optimised version of a simpler algorithm ShortGAC. Although experiments demonstrate the efficiency of ShortGAC compared with other general-purpose propagation algorithms where a compact set of short supports is available, we show theoretically and experimentally that HaggisGAC is even better. We also find that HaggisGAC performs better than GAC-Schema on full-length supports. We also introduce a variant algorithm HaggisGAC-Stable, which is adapted to avoid work on backtracking and in some cases can be faster and have significant reductions in memory use. All the proposed algorithms are excellent for propagating disjunctions of constraints. In all experiments with disjunctions we found our algorithms to be faster than Constructive Or and GAC-Schema by at least an order of magnitude, and up to three orders of magnitude.


page 1

page 2

page 3

page 4


Generalized Support and Formal Development of Constraint Propagators

Constraint programming is a family of techniques for solving combinatori...

The Weighted CFG Constraint

We introduce the weighted CFG constraint and propose a propagation algor...

An n-ary Constraint for the Stable Marriage Problem

We present an n-ary constraint for the stable marriage problem. This con...

Vortex: OpenCL Compatible RISC-V GPGPU

The current challenges in technology scaling are pushing the semiconduct...

View-based propagation of decomposable constraints

Constraints that may be obtained by composition from simpler constraints...

COSMIC: fast closed-form identification from large-scale data for LTV systems

We introduce a closed-form method for identification of discrete-time li...

Please sign up or login with your details

Forgot password? Click here to reset