Constraint propagation algorithms implement logical inference. For efficiency, it is essential to control whether and in what order basic inference steps are taken. We provide a high-level framework that clearly differentiates between information needed for controlling propagation versus that needed for the logical semantics of complex constraints composed from primitive ones. We argue for the appropriateness of our controlled propagation framework by showing that it captures the underlying principles of manually designed propagation algorithms, such as literal watching for unit clause propagation and the lexicographic ordering constraint. We provide an implementation and benchmark results that demonstrate the practicality and efficiency of our framework. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Brand, S., & Yap, R. H. C. (2006). Towards “propagation = logic + control.” In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4079 LNCS, pp. 102–116). Springer Verlag. https://doi.org/10.1007/11799573_10
Mendeley helps you to discover research relevant for your work.