Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints

Simple item page
dc.creatorBessiere, Christian
dc.creatorHebrard, Emmanuel
dc.creatorHnich, Brahim
dc.creatorKiziltan, Zeynep
dc.creatorWalsh, Toby
dc.date2009-03-02
dc.date.accessioned2026-07-07T12:48:06Z
dc.date.available2026-07-07T12:48:06Z
dc.descriptionWe 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.
dc.description41 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/0903.0211
dc.identifierhttp://arxiv.org/abs/0903.0211
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221937
dc.subjectArtificial Intelligence
dc.titleRange and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints
dc.typetext

Files

Collections

arXiv