View-Based Propagator Derivation - (Extended Abstract)
View-Based Propagator Derivation - (Extended Abstract)
复制标题
基于视图的传播器推导 - （扩展摘要）
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Guido Tack
中科院分区：
文献类型：
--
作者：
Christian Schulte;Guido Tack
当为约束实现传播器时，必须决定变量：当实现min时，是否也应该实现max？一个人是否应该同时实现有系数和无系数的线性方程？约束变体无处不在：实现它们需要相当大的努力，但会产生更好的性能。这个摘要展示了如何使用视图来导出传播算子的变体，其中导出的传播算子是完美的，因为它们继承了正确性和域和边界一致性等基本属性。系统地派生传播的技术开发，和抽象的草图的实现架构的意见，是独立的底层约束编程系统。在Gecode中实现的视图的评估表明，派生的传播是有效的，视图往往不会产生开销。视图对于实现Gecode来说是必不可少的，它大大减少了需要编写和维护的代码量。
When implementing a propagator for a constraint, one must decide about variants: When implementing min , should one also implement max ? Should one implement linear equations both with and without coefficients? Constraint variants are ubiquitous: implementing them requires considerable effort, but yields better performance. This abstract shows how to use views to derive propagator variants where derived propagators are perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators are developed, and the abstract sketches an implementation architecture for views that is independent of the underlying constraint programming system. Evaluation of views implemented in Gecode shows that derived propagators are efficient and that views often incur no overhead. Views have proven essential for implementing Gecode, substantially reducing the amount of code that needs to be written and maintained.