The typical constraint store transmits a limited amount of information because it consists only
of variable domains. We propose a richer constraint store in the form of a limited-width …

This document provides an introduction to modeling and programming with Gecode, an
open, free, portable, accessible, and efficient environment for developing constraint-based …

We present a novel solution approach to the container pre-marshalling problem using the A*
and IDA* algorithms combined with several novel branching and symmetry breaking rules …

In this paper, nogood recording is investigated for CSP within the randomization and restart
framework. Our goal is to avoid the same situations to occur from one run to the next ones …

This paper introduces MiniCP, a lightweight, open-source solver for constraint programming.
MiniCP is motivated by educational purposes and the desire to provide the core …

This paper discusses the usage of sparse sets for integer domain implementation over
traditional representations. A first benefit of sparse sets is that they are very cheap to trail …

The availability of commodity multi-core and multi-processor machines and the inherent
parallelism in constraint programming search offer significant opportunities for constraint …

BACKGROUND Machinery is traditionally serviced at recommended peri odic intervals
based on predetermined guidelines. For example, an automobile manufacturer may …

The main advantage of Constraint Programming (CP) approaches for sequential pattern
mining (SPM) is their modularity, which includes the ability to add new constraints (regular …

Abstract {log}(pronounced 'setlog') is a Constraint Logic Programming language that
embodies the fundamental forms of set designation and a number of primitive operations for …