1 citations · 2 across the 4 of their papers we have counts for
4 papers
Decomposition and Preprocessing of Ternary Constraint Networks
Pierre Talbot
Constraint programming is a general and exact method based on constraint propagation and backtracking search. We provide a function decomposing a constraint network into a ternary…
A Variant of Concurrent Constraint Programming on GPU
Pierre Talbot, Frédéric Pinel, Pascal Bouvry
The number of cores on graphical computing units (GPUs) is reaching thousands nowadays, whereas the clock speed of processors stagnates. Unfortunately, constraint programming solve…
Modular Constraint Solver Cooperation via Abstract Interpretation
Pierre Talbot, Éric Monfroy, Charlotte Truchet
Cooperation among constraint solvers is difficult because different solving paradigms have different theoretical foundations. Recent works have shown that abstract interpretation c…
Spacetime Programming: A Synchronous Language for Composable Search Strategies
Pierre Talbot
Search strategies are crucial to efficiently solve constraint satisfaction problems. However, programming search strategies in the existing constraint solvers is a daunting task an…