Solving non-binary convex CSPs in continuous domains

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

Volumn 1118, Issue , 1996, Pages 410-424

  Sam Haroud, Djamila ^a   Faltings, Boi V ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444438877     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_90     Document Type: Conference Paper

References (9)

1. Dechter R. From local to global consistency. In Proceedings of the 8th Canadian Conference on A1, 1990.
2. Dechter R., Meiri I., and Pearl J. Temporal constraint networks. In Artificial Intelligence 49(1-3), 1990.
3. Faltings B. Arc consistency for continuous variables. In Artificial Intelligence 65(2), 1994.
4. Haroud D. and Faltings B.V. Global consistency for continuous constraints. In Alan Borning, editor, Lecture notes in computer Science 874: Principles and Practice of constraint programming. Springer Verlag, 1994.
5. Saxa-Haroud D. Constraint consistency techniques for continuous domains. PhD thesis, Ecole Polytechnique Fédérale de Lausanne, Switzerland, 1995.
6. Sam-Haroud D. and Faltings B.V. Consistency techniques for continuous constraints. In Constraints Journal, 1, 1996.
7. Samet H. Applications of spatial data structures-Computer graphics, image processing and GIS. Addison-Wesley Publishing Company, 1993.
8. van Beek P. On the minimality and decomposability of constraint networks. In Proceedings of the l0th National Conference on AI, 1992.
9. van Beek P. and Dechter R. On the minimality and global consistency of row convex constraint networks. In Journal of the ACM, 1995.