Towards Solver-Independent Propagators [chapter]

Jean-Noël Monette, Pierre Flener, Justin Pearson
2012 Lecture Notes in Computer Science  
We present an extension to indexicals to describe propagators for global constraints. The resulting language is compiled into actual propagators for different solvers, and is solver-independent. In addition, we show how this high-level description eases the proof of propagator properties, such as correctness and monotonicity. Experimental results show that propagators compiled from their indexical descriptions are sometimes not significantly slower than built-in propagators of Gecode.
more » ... our language can be used for the rapid prototyping of new global constraints.
doi:10.1007/978-3-642-33558-7_40 fatcat:bfdk3e6f6rgyhd4p3bgrniffri