Programming is a rich discipline and practical programming languages are usually quite
complicated. Fortunately, the important ideas of programming languages are simple. This …

This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …

This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …

De nombreuses applications informatiques nécessitent de résoudre des problèmes de
décision qui sont difficiles d'un point de vue mathématique. La programmation par …

This paper revisits the tree constraint introduced in [2] which partitions the nodes of an-
nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only …

The tree constraint partitions a directed graph into node-disjoint trees. In many practical
applications that involve such a partition, there exist side constraints specifying requirements …

Many puzzle video games, like Sokoban, involve moving some agent in a maze. The
reachable locations are usually apparent for a human player, and the difficulty of the game is …

When practicing secure programming, it is important to understand the restrictive influence
programmed entities have on the propagation of authority in a program. To precisely model …

Discrete optimization problems are ubiquitous both in industry and theoretical computer
science. They appear in a wide range of fields, such as manufacturing, planning, packing …

Combinatorial problems based on graph partitioning enable us to mathematically represent
and model many practical applications. Mission planning and the routing problems …