-
A Declarative Approach to Modeling and Solving the View Selection Problem
View selection is important in many data-intensive systems e.g., commercial database and data warehousing systems to improve query performance. View selection can be... -
Spatial and Epistemic Modalities in Constraint-Based Process Calculi
International audience -
K-Stores: A Spatial and Epistemic Concurrent Constraint Interpreter
International audience -
A usage coverage based approach for assessing product family design
Adopting a utilitarian viewpoint of consumers on some service-oriented goods, we have first contributed to the proposal of a usage contexts model that a product should... -
An Optimal Constraint Programming Approach to the Open-Shop Problem
International audience -
Multi-site scheduling under production and transportation constraints
International audience -
A note on arithmetic constraint propagation
We consider the resolution by constraint programming of large problems, i.e. involving millions of constraints, which mainly imply arithmetic constraints, like... -
Towards a Generic Trace for Rule Based Constraint Reasoning
CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers... -
Knockout Prediction for Reaction Networks with Partial Kinetic Information
International audience -
CLP a technology for the interactive resolution of spatial configuration task...
International audience -
Compiling Constraints in clp(FD)
International audience -
A Type System for CHR
We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level... -
New Light on Arc Consistency over Continuous Domains
Hyvönen and Faltings observed that propagation algorithms with continuous variables are computationally extremely inefficient when unions of intervals are used to... -
A Tour Scheduling Problem with Fixed Jobs: use of Constraint Programming
International audience -
Improving the Asymmetric TSP by Considering Graph Structure
Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over... -
Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences fo...
International audience -
Automata and Constraint Programming for Personnel Scheduling Problems
As soon as a structure is organized, the ability to put the right people at the right time is critical to satisfy the need of a department, a school or a company. We... -
Cumulative scheduling with overloads of resource : Global constraint and deco...
Constraint programming is an interesting approach to solve scheduling problems. In cumulative scheduling, activities are defined by their starting date, their duration... -
Constrained Types - Future Directions
Position Paper -
Using Constraint Programming for Solving the Reachability Problem in Timed Pe...
International audience
