About
11
Publications
701
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
10
Citations
Publications
Publications (11)
Search strategies are crucial to efficiently solve constraint satisfaction problems. However, programming search strategies in the existing constraint solvers is a daunting task and constraint-based languages usually have compositionality issues. We propose spacetime programming, a paradigm extending the synchronous language Esterel and timed concu...
Cooperation among constraint solvers is difficult because different solving paradigms have different theoretical foundations. Recent works have shown that abstract interpretation can provide a unifying theory for various constraint solvers. In particular, it relies on abstract domains which capture constraint languages as ordered structures. The ke...
The number of cores on graphical computing units (GPUs) is reaching thousands nowadays, whereas the clock speed of processors stagnates. Unfortunately, constraint programming solvers do not take advantage yet of GPU parallelism. One reason is that constraint solvers were primarily designed within the mental frame of sequential computation. To solve...
Cooperation among constraint solvers is difficult because different solving paradigms have different theoretical foundations. Recent works have shown that abstract interpretation can provide a unifying theory for various constraint solvers. In particular, it relies on abstract domains which capture constraint languages as ordered structures. The ke...
Search strategies are crucial to efficiently solve constraint satisfaction problems. However, programming search strategies in the existing constraint solvers is a daunting task and constraint-based languages usually have compositionality issues. We propose spacetime programming, a paradigm extending the synchronous language Esterel and timed concu...
En programmation par contraintes, l'efficacité des solveurs est principalement due aux contraintes globales qui encapsulent des algorithmes de résolution spécifiques.
Une conséquence est la prolifération de centaines de contraintes globales qui sont spécialisées pour des problèmes très particuliers.
Dans cet article, nous étudions une approche basé...
Constraint programming is a paradigm for computing with mathematical relations named constraints.It is a declarative approach to describe many real-world problems including scheduling, vehicles routing, biology and musical composition.Constraint programming must be contrasted with procedural approaches that describe how a problem is solved, whereas...
Solving constraint satisfaction problems (CSP) efficiently depends on the solver configuration and the search strategy.
However, it is difficult to customize the constraint solvers because they are not modular enough, and it is hard to create new search strategies by composition.
To solve these problems, we propose spacetime programming, a paradigm...
Projects
Projects (2)
Design and implementation of a programming language to create and explore combinatorial state space. The emphasis is put on the combination of search strategies.
