The rough guide to constraint propagation

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

Volumn 1713, Issue , 1999, Pages 1-23

  Apt, Krzysztof R ^a,b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

COMMUTATIVITY; CONSTRAINT PROPAGATION; CONSTRAINT PROPAGATION ALGORITHMS; GENERIC ALGORITHM;

ALGORITHMS;

EID: 84957371655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_1     Document Type: Conference Paper

References (17)

1. K. R. Apt. The essence of constraint propagation. Theoretical Computer Science, 221(1– 2):179–210, 1999. Available via http://xxx.lanl.gov/archive/cs/.
2. F. Benhamou. Heterogeneous constraint solving. In M. Hanus and M. Rodriguez-Artalejo, editors, Proceeding of the Fifth International Conference on Algebraic and Logic Programming (ALP 96), Lecture Notes in Computer Science 1139, pages 62–76, Berlin, 1996. Springer- Verlag.
3. F. Benhamou and W. Older. Applying interval arithmetic to real, integer and Boolean constraints. Journal of Logic Programming, 32(1):1–24, 1997.
4. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201–236, March 1997.
5. R. Dechter. Bucket elimination: A unifying framework for structure-driven inference. Artificial Intelligence, 1999. To appear.
6. R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34(1):1–38, January 1988.
7. R. Dechter and P. van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283–308, 20 February 1997.
8. C. Han and C. Lee. Comments onMohr and Henderson’s path consistency algorithm. Artificial Intelligence, 36:125–130, 1988.
9. A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.
10. K. Marriott and P. Stuckey. Programming with Constraints. The MIT Press, Cambridge, Massachusetts, 1998.
11. R. Mohr and T.C. Henderson. Arc-consistency and path-consistency revisited. Artificial Intelligence, 28:225–233, 1986.
12. R. Mohr and G. Masini. Good old discrete relaxation. In Y. Kodratoff, editor, Proceedings of the 8th European Conference on Artificial Intelligence (ECAI), pages 651–656. Pitman Publishers, 1988.
13. E. Monfroy and J.-H. Rèty. Chaotic iteration for distributed constraint propagation. In J. Carroll, H. Haddad, D. Oppenheim, B. Bryant, and G. Lamont, editors, Proceedings of The 1999 ACM Symposium on Applied Computing, SAC’99, pages 19–24, San Antonio, Texas, USA, March 1999. ACM Press.
14. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7(2):95–132, 1974. Also TechnicalReport,Carnegie Mellon University, 1971.
15. V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages (POPL’91), pages 333–352, 1991.
16. V. Telerman and D. Ushakov. Data types in subdefinite models. In J. A. Campbell J. Calmet and J. Pfalzgraf, editors, Artificial Intelligence and Symbolic Mathematical Computations, Lecture Notes in Computer Science 1138, pages 305–319, Berlin, 1996. Springer-Verlag.
17. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.