ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1537 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0304-3975(99)00032-8    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1999 Published by Elsevier Science B.V.

Contribution

The essence of constraint propagation*1

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Krzysztof R. Aptb, E-mail The Corresponding Author, a

a CWI, P.O. Box 94079, 1009 AB, Amsterdam, Netherlands

b Department of Mathematics, Computer Science, Physics and Astronomy, University of Amsterdam, Netherlands


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

• References

*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.


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.