Global Constraint Catalog: Cbalance

5.46. balance_modulo

DESCRIPTION

LINKS

GRAPH

AUTOMATON

Origin

Derived from $𝚋𝚊𝚕𝚊𝚗𝚌𝚎$ .

Constraint

$𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘 (𝙱𝙰𝙻𝙰𝙽𝙲𝙴, 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂, 𝙼)$

Arguments

$𝙱𝙰𝙻𝙰𝙽𝙲𝙴$	$𝚍𝚟𝚊𝚛$
$𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$	$𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗 (𝚟𝚊𝚛 - 𝚍𝚟𝚊𝚛)$
$𝙼$	$𝚒𝚗𝚝$

Restrictions

𝙱𝙰𝙻𝙰𝙽𝙲𝙴 \geq 0

𝙱𝙰𝙻𝙰𝙽𝙲𝙴 \leq 𝚖𝚊𝚡 (0, | 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 | - 2)

𝚛𝚎𝚚𝚞𝚒𝚛𝚎𝚍

(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂, 𝚟𝚊𝚛)

𝙼 > 0

Purpose

Consider the largest set $𝒮_{1}$ (respectively the smallest set $𝒮_{2}$ ) of variables of the collection $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ that have the same remainder when divided by $𝙼$ . $𝙱𝙰𝙻𝙰𝙽𝙲𝙴$ is equal to the difference between the cardinality of $𝒮_{2}$ and the cardinality of $𝒮_{1}$ .

Example

(2, 〈6, 1, 7, 1, 5〉, 3)

In this example values 6, 1, 7, 1, 5 are respectively associated with the equivalence classes $6 \mod 3 = 0$ , $1 \mod 3 = 1$ , $7 \mod 3 = 1$ , $1 \mod 3 = 1$ , $5 \mod 3 = 2$ . Therefore the equivalence classes 0, 1 and 2 are respectively used 1, 3 and 1 times. The $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint holds since its first argument $𝙱𝙰𝙻𝙰𝙽𝙲𝙴$ is assigned to the difference between the maximum and minimum number of the previous occurrences (i.e., $3 - 1$ ).

Typical

| 𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 | > 2

𝙼 > 1

𝙼 <

𝚖𝚊𝚡𝚟𝚊𝚕

(𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 . 𝚟𝚊𝚛)

Symmetries

Items of $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ are permutable.
An occurrence of a value $u$ of $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂 . 𝚟𝚊𝚛$ can be replaced by any other value $v$ such that $v$ is congruent to $u$ modulo $𝙼$ .

Arg. properties

Functional dependency: $𝙱𝙰𝙻𝙰𝙽𝙲𝙴$ determined by $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ and $𝙼$ .

Usage

An application of the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint is to enforce a balanced assignment of values, no matter how many distinct equivalence classes will be used. In this case one will push down the maximum value of the first argument of the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint.

See also

specialisation: $𝚋𝚊𝚕𝚊𝚗𝚌𝚎$ ( $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎 \mod 𝚌𝚘𝚗𝚜𝚝𝚊𝚗𝚝$ replaced by $𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎$ ).

Keywords

application area: assignment.

characteristic of a constraint: modulo, automaton, automaton with array of counters.

constraint arguments: pure functional dependency.

constraint type: value constraint.

final graph structure: equivalence.

modelling: balanced assignment, functional dependency.

Arc input(s)

$𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$

Arc generator

𝐶𝐿𝐼𝑄𝑈𝐸

\mapsto 𝚌𝚘𝚕𝚕𝚎𝚌𝚝𝚒𝚘𝚗 (𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1, 𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2)

Arc arity

Arc constraint(s)

𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 1 . 𝚟𝚊𝚛 \mod 𝙼 = 𝚟𝚊𝚛𝚒𝚊𝚋𝚕𝚎𝚜 2 . 𝚟𝚊𝚛 \mod 𝙼

Graph property(ies)

𝐑𝐀𝐍𝐆𝐄_𝐍𝐒𝐂𝐂

= 𝙱𝙰𝙻𝙰𝙽𝙲𝙴

Graph class

𝙴𝚀𝚄𝙸𝚅𝙰𝙻𝙴𝙽𝙲𝙴

Graph model

The graph property $𝐑𝐀𝐍𝐆𝐄_𝐍𝐒𝐂𝐂$ constraints the difference between the sizes of the largest and smallest strongly connected components.

Parts (A) and (B) of Figure 5.46.1 respectively show the initial and final graph associated with the Example slot. Since we use the $𝐑𝐀𝐍𝐆𝐄_𝐍𝐒𝐂𝐂$ graph property, we show the largest and smallest strongly connected components of the final graph.

Figure 5.46.1. Initial and final graph of the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint


(a)	(b)

Automaton: Figure 5.46.2 depicts the automaton associated with the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint. To each item of the collection $𝚅𝙰𝚁𝙸𝙰𝙱𝙻𝙴𝚂$ corresponds a signature variable $S_{i}$ that is equal to 1.

Figure 5.46.2. Automaton of the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint

Global Constraint Catalog

5. Global Constraint Catalogue

5.46. balance_modulo

Figure 5.46.1. Initial and final graph of the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint

Figure 5.46.2. Automaton of the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint

Global Constraint Catalog

5. Global Constraint Catalogue

5.46. balance_modulo

Figure 5.46.1. Initial and final graph of the 𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘 constraint

Figure 5.46.2. Automaton of the 𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘 constraint

Figure 5.46.1. Initial and final graph of the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint

Figure 5.46.2. Automaton of the $𝚋𝚊𝚕𝚊𝚗𝚌𝚎_𝚖𝚘𝚍𝚞𝚕𝚘$ constraint