Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

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. © 2009 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., & Walsh, T. (2009). Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints. Artificial Intelligence, 173(11), 1054–1078. https://doi.org/10.1016/j.artint.2009.03.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free