利用复合算子增强约束传播
Enhancing Constraint Propagation with Composition Operators
摘要：
约束传播是用于修剪CSP的搜索空间的通用算法方法。以一种统一的方式，K。R. Apt将计算定义为在一个域上的约简函数的迭代。他还证明了需要集成约简函数的静态属性（交换性和半交换性）来设计专门的算法，如AC3和DAC。我们在这里介绍了一组操作符的组合约简函数建模。其中两个主要目标是解决并行计算和动态行为（如缓慢收敛）。
英文摘要：
Constraint propagation is a general algorithmic approach for pruning the search space of a CSP. In a uniform way, K. R. Apt has defined a computation as an iteration of reduction functions over a domain. He has also demonstrated the need for integrating static properties of reduction functions (commutativity and semi-commutativity) to design specialized algorithms such as AC3 and DAC. We introduce here a set of operators for modeling compositions of reduction functions. Two of the major goals are to tackle parallel computations, and dynamic behaviours (such as slow convergence).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
