Thierry Sola

Learn More
In this paper we study a reactive extension of constraint logic programming. Our primary concerns are search problems in a dynamic environment , where interactions with the user (e.g. in interactive multi-criteria optimization problems) or interactions with the physical world (e.g. in time evolving problems) can be modeled and solved eeciently. Our approach(More)
We propose an implementation of constraint solving over nite domains, as pioneered by CHIP, on top of any Prolog system that provides a delay mechanism and backtrackable assignment. The aim is to propose a simple, portable, easily-maintenable, but yet eecient package. The performances of our system are of the same order of magnitude than a "wired"(More)
In many Constraint Logic Programming (CLP) applications one needs to express not only strict requirements but also preferences. Constraint hierarchies are one way of describing preferred criteria in the statement of a problem. In 18] CLP was extended to integrate constraint hierarchies resulting in Hierarchical Constraint Logic Programming (HCLP). We(More)
Nous définissons un modèle d'exécution réactif et interactif pour la programmation logique avec contraintes (PLC). Ce modèle d'exécution s'appuie d'une part sur un système de transformation des dérivations CSLD pour l'ajout et le retrait de contraintes et d'atomes dans la requête, et d'autre part sur un résolveur de contraintes dynamiques supportant l'ajout(More)
  • 1