In this document, we introduce PyCSP $3 $, a Python library that allows us to write models of
combinatorial constrained problems in a declarative manner. Currently, with PyCSP $3 …

These last years, there has been a growing interest for structures like tables and decision
diagrams in Constraint Programming (CP). This is due to the universal character of these …

We study a planning problem based on Plotting, a tile-matching puzzle video game
published by Taito in 1989. The objective of this turn-based game is to remove a target …

Combinatorial optimisation has numerous practical applications, such as planning, logistics,
or circuit design. Problems such as these can be solved by approaches such as Boolean …

We describe the constraint modelling tool Savile Row, its input language and its main
features. Savile Row translates a solver-independent constraint modelling language to the …

We focus on a planning problem based on Plotting, a tile-matching puzzle video game
published by Taito. The objective of the game is to remove at least a certain number of …

The performance of a constraint model can often be improved by converting a subproblem
into a single table constraint. In this paper we study heuristics for identifying promising …

Frequent itemset mining (FIM) is a method for finding regularities in transaction databases. It
has several application areas, such as market basket analysis, genome analysis, and drug …

Constraint programming is a widely used paradigm to solve combinatorial problems. High-
level constraint modelling languages, such as MiniZinc, GAMS, OPL, and AMPL, encourage …

Choco solver already has a long history: the first line of code was written in 1999 [11]. Since
then, the code has been frequently re-engineered and released, up to version 4.0. 8, the last …