Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

This article follows a tutorial, given by the authors on dynamic constraint solving at CP 2003
(Ninth International Conference on Principles and Practice of Constraint Programming) in …

Monitoring environmental evolutions, one of the most crucial axes on which sustainable
development is based, requires the knowledge of information on the observed geographical …

Publisher Summary This chapter explains that configuration is the task of composing a
customized system out of generic components. This task is of universal concern as …

Abstract Conditional Constraint Satisfaction Problems (CC-SPs) are generalizations of
classical CSPs that support conditional activation of variables and constraints. Despite the …

Numerous frameworks dedicated to the modeling of discrete event dynamic systems have
been proposed to deal with programming, simulation, validation, situation tracking, or …

Embodiment design (ED) is an early phase of product development. ED problems consist of
finding solution principles that satisfy product requirements such as physics behaviors and …

We present a new framework, managing Constraint Satisfaction Problems (CSPs) with
preferences in a dynamic environment. Unlike the existing CSP models managing one form …

Option types are a powerful abstraction that allows the concise modelling of combinatorial
problems where some decisions are relevant only if other decisions are made. They have a …

Over the years, a whole sector of AI dealing with configuration problems has emerged, and
since 1996, an annual configuration workshop has been held in affiliation with a major AI …