A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Towards Solver-Independent Propagators
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
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.
doi:10.1007/978-3-642-33558-7_40
fatcat:bfdk3e6f6rgyhd4p3bgrniffri