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 …

This paper deals with the mathematical formulation of tolerance analysis. The mathematical
formulation presented in this paper simulates the influences of geometrical deviations on the …

Let a quantified inequality constraint over the reals be a formula in the first-order predicate
language over the structure of the real numbers, where the allowed predicate symbols are≤ …

Tolerancing decisions can profoundly impact the quality and cost of the mechanism. To
evaluate the impact of tolerance on mechanism quality, designers need to simulate the …

We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated
representations of combinatorial constrained problems. This new format is able to deal with …

The aim of this paper is to model and mine patterns combining several local patterns (n-ary
patterns). First, the user expresses his/her query under constraints involving n-ary patterns …

Abstract The language of Quantified Boolean Formulas (QBF) has a lot of potential
applications to Formal Verification (FV) tasks, as it captures many of these tasks in a natural …

In this paper we argue that an attractive and potentially very general way of achieving
generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a …

We study the complexity of two-person constraint satisfaction games. An instance of such a
game is given by a collection of constraints on overlapping sets of variables, and the two …

The QCSP+ language we introduce extends the framework of Quantified Constraint
Satisfaction Problems (QCSPs) by enabling us to neatly express restricted quantifications …