Charlotte Truchet

Learn More
This paper introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time constraints. The constraint kernel is generic in the sense that one of its parameters is a set of constraints on subsets of the objects. These constraints are handled globally by the(More)
We propose an environment for musical constraint solving, adapted to contemporary composition, in the visual programming language OpenMusic. We describe the use of two algorithms, a complete one and an incomplete one. The latter is a local search algorithm, called adaptive search. Adaptive search refines the concept of cost function by taking into account(More)
—We propose a probabilistic model for the parallel execution of Las Vegas algorithms, i.e. randomized algorithms whose runtime might vary from one execution to another, even with the same input. This model aims at predicting the parallel performances (i.e. speedups) by analysis the runtime distribution of the sequential runs of the algorithm. Then, we study(More)
We propose an environment for musical constraint solving, adapted to contemporary composition, in the visual programming language OpenMusic. The composer start with a predefined score and set constraint between some objects in a visual way. These constraints are translated in a specific syntax in order to be solved using an algorithm of adaptive research.(More)
This report presents a database of about¨© © graph invariants for deriving systematically necessary conditions from the graph properties based representation of global constraints. This scheme is based on invariants on the graph characteristics used in the description of a global constraint. A SICStus Prolog implementation based on arithmetic and logical(More)
In this article, we apply techniques from Abstract Interpretation (a general theory of semantic abstractions) to Constraint Programming (which aims at solving hard combinatorial problems with a generic framework based on first-order logics). We highlight some links and differences between these fields: both compute fixpoints by iteration but employ(More)
We here propose a generic, domain-independent local search method called Adaptive Search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advantage of the structure of the problem in terms of constraints and variables and can guide the search more precisely than a global cost function to optimize (such as for(More)
Domains in continuous constraint programming are generally represented with intervals whose n-ary Cartesian product (box) approximates the solution space. In this article, we generalize this representation and propose a generic solver where other domains representations can be used. In this framework, we define a new representation for continuous domains(More)