Abstract
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. Therefore, our language can be used for the rapid prototyping of new global constraints. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Monette, J. N., Flener, P., & Pearson, J. (2012). Towards solver-independent propagators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7514 LNCS, pp. 544–560). https://doi.org/10.1007/978-3-642-33558-7_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
