The Rough Guide to Constraint Propagation
Artificial Intelligence
2007-05-23 v1 Programming Languages
Abstract
We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In particular, using the notions commutativity and semi-commutativity, we show how the well-known AC-3, PC-2, DAC and DPC algorithms are instances of a single generic algorithm. The work reported here extends and simplifies that of Apt, cs.AI/9811024.
Cite
@article{arxiv.cs/9909009,
title = {The Rough Guide to Constraint Propagation},
author = {Krzysztof R. Apt},
journal= {arXiv preprint arXiv:cs/9909009},
year = {2007}
}
Comments
23 pages. To appear in the Proc. 5th International Conference on Principles and Practice of Constraint Programming as an invited talk