We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the Range and Roots constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.
Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints / C. Bessiere; E. Hebrard; B. Hnich; Z. Kiziltan; T. Walsh. - In: ARTIFICIAL INTELLIGENCE. - ISSN 0004-3702. - STAMPA. - 173(11):(2009), pp. 1054-1078. [10.1016/j.artint.2009.03.001]
Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints
KIZILTAN, ZEYNEP;
2009
Abstract
We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the Range and Roots constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.