Copyright © 1999 Published by Elsevier Science B.V.
Contribution
The essence of constraint propagation*1
Available online 13 August 1999.
Abstract
We show that several constraint propagation algorithms (also called (local) consistency, consistency enforcing, Waltz, filtering or narrowing algorithms) are instances of algorithms that deal with chaotic iteration. To this end we propose a simple abstract framework that allows us to classify and compare these algorithms and to establish in a uniform way their basic properties.
Author Keywords: Constraint propagation; Chaotic iteration; Generic algorithms
Article Outline
*1 This is a full, revised version of our article From Chaotic Iteration to Constraint Propagation, Proc. 24th Internat. Colloquium on Automata, Languages and Programming (ICALP '97), (invited lecture), Springer, Lecture Notes in Computer Science, vol. 1256, 1997, pp. 36–55.






E-mail Article
Add to my Quick Links

Cited By in Scopus (38)






