A Probabilistic Study of Bound Consistency for the Alldifferent Constraint

Abstract

This paper introduces a mathematical model for bound consistency of the constraint AllDifferent. It allows us to compute the probability that the filtering algorithm effectively removes at least one value in the variable domains. A complete study of the bound consistency properties is then proposed. It identifies several behaviors depending on some… (More)

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Boisberranger2011APS, title={A Probabilistic Study of Bound Consistency for the Alldifferent Constraint}, author={J{\'e}r{\'e}mie Du Boisberranger and Dani{\`e}le Gardy and Xavier Lorca and Charlotte Truchet}, year={2011} }