Prom chaotic iteration to constraint propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 36-55

  Apt, Krzysztof R ^a,b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CHAOTIC ITERATION; CONSTRAINT PROPAGATION;

AUTOMATA THEORY;

EID: 84950988761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_163     Document Type: Conference Paper

References (16)

1. Apt, K. (1997). A proof theoretic view of constraint programming, Technical report, CWI, Amsterdam. In preparation.
2. 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.
3. Benhamou, F. and Older, W. (1997). Applying interval arithmetic to real, integer and Boolean constraints, Journal of Logic Programming. Technical report 1994. To appear.
4. 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.
5. Chazan, D. and Miranker, W. (1969). Chaotic relaxation, Linear Algebra and its Applications 2: 199-222.
6. Cousot, P. and Cousot, R. (1977). Automatic synthesis of optimal invariant assertions: mathematical foundations, A CM Symposium on Artificial Intelligence and Programming Languages, SIGPLAN Notices 12 (8), pp. 1-12.
7. Dechter, Ft. and Pearl, J. (1988). Network-based heuristics for constraint-satisfaction problems, Artificial Intelligence 34(1): 1-38.
8. Dechter, R. and van Beek, P. (1997). Local and global relational consistency, Theoretical Computer Science 173(1): 283-308.
9. 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.
10. Mackworth, A. (1977). Consistency in networks of relations, Artificial Intelligence 8(1): 99-118.
11. Mohr, R. and Henderson, T. (1986). Arc-consistency and path-consistency revisited, Artificial Intelligence 28: 225-233.
12. Montanari, U. and Rossi, F, (1991). Constraint relaxation may be perfect, Artificial Intelligence 48: 143-170.
13. 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.
14. 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.
15. van Emden, M. H. (1996). Value constraints in the CLP scheme, Technical Report CS-R9603, CWI, Amsterdam. To appear in the Constraints journal.
16. Van Hentenryck, P., Deville, Y. and Teng, C. (1992). A generic arc-consistency algorithm and its specializations, Artificial Intelligence 57(2-3): 291-321.