The essence of constraint propagation

Theoretical Computer Science

Volumn 221, Issue 1-2, 1999, Pages 179-210

  Apt, Krzysztof R ^a  

^a CWI   (Netherlands)

Author keywords

Chaotic iteration; Constraint propagation; Generic algorithms

Indexed keywords

EID: 0001751689     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00032-8     Document Type: Article

References (31)

1. K.R. Apt, A proof theoretic view of constraint programming, Fund. Inform. 33(3) (1998) 263-293. Available via http://www.cwi.nl/~apt.
2. J. Barwise, L. Moss, Vicious Circles: on the Mathematics of Circular Phenomena, CSLI-Lecture Notes. Center for the Study of Language and Information, Stanford, California, 1996.
3. G.M. Baudet, Asynchronous iterative methods for multiprocessors, J. ACM 25(2) (1978) 226-244.
4. F. Benhamou, Heterogeneous constraint solving, in: M. Hanus, M. Rodriguez-Artalejo (Eds.), Proc. 5th Internat. Conf. on Algebraic and Logic Programming (ALP 96), Lecture Notes in Computer Science, vol. 1139, Springer, Berlin, 1996, pp. 62-76.
5. F. Benhamou, D.A. McAllester, P. Van Hentenryck, CLP(intervals) revisited, in: M. Bruynooghe (Ed.), Proc. 1994 Internat. Logic Programming Symp. MIT Press, Cambridge, MA, 1994, pp. 124-138.
6. F. Benhamou, W. Older, Applying interval arithmetic to real, integer and Boolean constraints, J. Logic Programm. 32(1) 1997, 1-24.
7. Y. Caseau, Abstract interpretation of constraints on order-sorted domains, in: V. Saraswat, K. Ueda (Eds.), Proc. 1991 Internat. Logic Programming Symp., The MIT Press, Cambridge, MA, 1991, pp. 435-452.
8. D. Chazan, W. Miranker, Chaotic relaxation, Linear Algebra Appl. 2 (1969) 199-222.
9. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver, Combinatorial Optimization, Wiley, New York, 1998.
10. P. Cousot, Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique des programmes, Ph.D. Thesis, Université Scientifique et Médicale de Grenoble, 1978.
11. P. Cousot, R. Cousot, Automatic synthesis of optimal invariant assertions: mathematical foundations, in: ACM Symp. on Artificial Intelligence and Programming Languages, SIGPLAN Notices 12 (8), 1977, pp. 1-12.
12. E. Davis, Constraint propagation with interval labels, Artif. Intell. 32(3) (1987) 281-331.
13. R. Dechter, J. Pearl, Network-based heuristics for constraint-satisfaction problems, Artif. Intell. 34(1) (1988) 1-38.
14. R. Dechter, P. van Beek, Local and global relational consistency, Theoret. Comput. Sci. 173(1) (1997) 283-308.
15. Y. Deville, O. Barette, P. Van Hentenryck, Constraint satisfaction over connected row convex constraints, in: Proc. Internat. Joint Conf. on Artificial Intelligence (IJCAI-97), 1997.
16. F. Fages, J. Fowler, T. Sola, Experiments in reactive constraint logic programming, J. Logic Programm. 37 (1-3) (1998) 185-212.
17. H.-W. Güsgen, J. Hertzberg, Some fundamental properties of local constraint propagation, Artif. Intell. 36(2) (1988) 237-247.
18. O. Lhomme, Consistency techniques for numeric CSPs, in Proc. Internat. Joint Conf. on Artificial Intelligence (IJCAI-93), 1993, pp. 232-238.
19. A. Mackworth, Consistency in networks of relations, Artif. Intell. 8(1) (1977) 99-118.
20. R. Mohr, T.C. Henderson, Arc-consistency and path-consistency revisited, Artif. Intell. 28 (1986) 225-233.
21. R. Mohr, G. Masini, Good old discrete relaxation, in: Y. Kodratoff (Ed.), Proc. 8th European Conf. on Artificial Intelligence (ECAI), Pitman, London, 1988, pp. 651-656.
22. E. Monfroy, J.-H. Réty, Chaotic iteration for distributed constraint propagation, in: ACM Symp. on Applied Computing (SAC), 1999, ACM press, pp. 19-24.
23. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing, Inform. Sci. 7(2) (1974) 95-132. Also Technical Report, Carnegie Mellon University, 1971.
24. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing, Inform. Sci. 7(2) (1974) 95-132. Also Technical Report, Carnegie Mellon University, 1971.
25. U. Montanari, F. Rossi, Constraint relaxation may be perfect, Artif. Intell. 48 (1991) 143-170.
26. W. Older, A. Vellino, Constraint arithmetic on real intervals, in: F. Benhamou, A. Colmerauer (Eds.), Constraint Logic Programming: Selected Research, MIT Press, Cambridge, MA, 1993, pp. 175-195.
27. V.A. Saraswat, M. Rinard, P. Panangaden, Semantic foundations of concurrent constraint programming, in: Proc. 18th Annual ACM Symp. on Principles of Programming Languages (POPL'91), 1991, pp. 333-352.
28. V. Telerman, D. Ushakov, Data types in subdefinite models, in: J.A. Campbell, J. Calmet, J. Pfalzgraf (Eds.), Artificial Intelligence and Symbolic Mathematical Computations, Lecture Notes in Computer Science, vol. 1138, Springer, Berlin, 1996, 305-319.
29. M.H. van Emden, Value constraints in the CLP scheme, Constraints 2(2) (1997) 163-184.
30. P. Van Hentenryck, Y. Deville, Choh-Man Teng, A generic arc-consistency algorithm and its specializations, Artif. Intell. 57(2-3) (1992) 291-321.
31. D.L. Waltz, Generating semantic descriptions from drawings of scenes with shadows, in: P.H. Winston (Ed.), The Psychology of Computer Vision, McGraw-Hill, New York, 1975.