no code implementations • 27 Feb 2020 • Heytem Zitoun, Claude Michel, Laurent Michel, Michel Rueher
The empirical evaluation demonstrates that the 2019 version of \us{} is competitive on computationally challenging floating point benchmarks that induce significant search efforts even for other CP solvers.
no code implementations • 27 Feb 2020 • Heytem Zitoun, Claude Michel, Laurent Michel, Michel Rueher
Program verification techniques typically focus on finding counter-examples that violate properties of a program.
no code implementations • 21 Jan 2014 • Laurent Michel, Pascal Van Hentenryck
This paper presents a microkernel architecture for constraint programming organized around a number of small number of core functionalities and minimal interfaces.
no code implementations • 21 Jan 2014 • Pascal Van Hentenryck, Laurent Michel
Traditional constraint-programming systems provide the concept of {\em variable views} which implement a view of the type $y = f(x)$ by delegating all (domain and constraint) operations on variable $y$ to variable $x$.
