1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.AI2020★ 1 cited
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…
cs.PL2019
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…