Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
The Range Constraint: Algorithms and Implementation
verfasst von : Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh
Erschienen in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We recently proposed a simple declarative language for specifying a wide range of counting and occurrence constraints. The language uses just two global primitives: the
Range
constraint, which computes the range of values used by a set of variables, and the
Roots
constraint, which computes the variables mapping onto particular values. In order for this specification language to be executable, propagation algorithms for the
Range
and
Roots
constraints should be developed. In this paper, we focus on the study of the
Range
constraint. We propose an efficient algorithm for propagating the
Range
constraint. We also show that decomposing global counting and occurrence constraints using
Range
is effective and efficient in practice.