Skip to main content
SpringerLink
Log in

From chaotic iteration to constraint propagation

  • Invited Papers
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1256))

Included in the following conference series:

Abstract

We show how the constraint propagation process can be naturally explained by means of chaotic iteration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Apt, K. (1997). A proof theoretic view of constraint programming, Technical report, CWI, Amsterdam. In preparation.

    Google Scholar 

  • Barwise, J. and Moss, L. (1996). Vicious Circles: on the mathematics of circular phenomena, CSLI-Lecture Notes, Center for the Study of Language and Information, Stanford, California.

    Google Scholar 

  • Benhamou, F. and Older, W. (1997). Applying interval arithmetic to real, integer and Boolean constraints, Journal of Logic Programming. Technical report 1994. To appear.

    Google Scholar 

  • Benhamou, F., McAllester, D. and Hentenryck, P. V. (1994). CLP (intervals) revisited, in M. Bruynooghe (ed.), Proceedings of the 1994 International Logic Programming Symposium, pp. 124–138.

    Google Scholar 

  • Chazan, D. and Miranker, W. (1969). Chaotic relaxation, Linear Algebra and its Applications 2: 199–222.

    Article  Google Scholar 

  • Cousot, P. and Cousot, R. (1977). Automatic synthesis of optimal invariant assertions: mathematical foundations, ACM Symposium on Artificial Intelligence and Programming Languages, SIGPLAN Notices 12 (8), pp. 1–12.

    Google Scholar 

  • Dechter, R. and Pearl, J. (1988). Network-based heuristics for constraint-satisfaction problems, Artificial Intelligence 34(1): 1–38.

    Article  Google Scholar 

  • Dechter, R. and van Beek, P. (1997). Local and global relational consistency, Theoretical Computer Science 173(1): 283–308.

    Article  Google Scholar 

  • Fages, F., Fowler, J. and Sola, T. (1996). Experiments in reactive constraint logic programming, Technical report, DMI — LIENS CNRS, Ecole Normale Supérieure. Submitted for publication.

    Google Scholar 

  • Mackworth, A. (1977). Consistency in networks of relations, Artificial Intelligence 8(1): 99–118.

    Article  Google Scholar 

  • Mohr, R. and Henderson, T. (1986). Arc-consistency and path-consistency revisited, Artificial Intelligence 28: 225–233.

    Article  Google Scholar 

  • Montanari, U. and Rossi, F. (1991). Constraint relaxation may be perfect, Artificial Intelligence 48: 143–170.

    Article  Google Scholar 

  • Older, W. and Vellino, A. (1993). Constraint arithmetic on real intervals, in F. Benhamou and A. Colmerauer (eds), Constraint Logic Programming: Selected Research, MIT Press, pp. 175–195.

    Google Scholar 

  • Saraswat, V., Rinard, M. and Panangaden, P. (1991). Semantic foundations of concurrent constraint programming, Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages (POPL'91), pp. 333–352.

    Google Scholar 

  • van Emden, M. H. (1996). Value constraints in the CLP scheme, Technical Report CS-R9603, CWI, Amsterdam. To appear in the Constraints journal.

    Google Scholar 

  • Van Hentenryck, P., Deville, Y. and Teng, C. (1992). A generic arc-consistency algorithm and its specializations, Artificial Intelligence 57(2–3): 291–321.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 94079, 1009, AB Amsterdam, The Netherlands

    Krzysztof R. Apt

  2. Dept. of Mathematics, Computer Science, Physics & Astronomy, University of Amsterdam, The Netherlands

    Krzysztof R. Apt

Authors
  1. Krzysztof R. Apt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Apt, K.R. (1997). From chaotic iteration to constraint propagation. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_163

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_163

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation