Page 160 - 4495

52. Philippe Baptiste and Claude Le Pape. Edge-finding constraint

propagation algorithms for disjunctive and cumulative scheduling. In Pro-
ceedings of the Fif- teenth Workshop of the U.K. Planning Special Interest
Group, 1996.

53. Claude La Pape and Phillippe Baptiste. Constraint-based
scheduling: a theo- retical comparison of resource constraint propagation
rules. In Wim Nuijten Jean-Charle Régin, editor,

54. Yves Caseau and François Laburthe. Cumulative scheduling
with task inter- vals. In Michael Maher, editor, Proceedings of the 1996
Joint International Confer- ence and Symposium on Logic Programming,
pages 363–377. MIT Press, 1996.

55. Wim P. M. Nuijten and Emile H. L. Aarts. A computational
study of constraint satisfaction for multiple capacitated job shop schedul-
ing. European Journal of Operational Research, 90(2):269–284, 1996.

56. Abderrahmane Aggoun and Nicolas Beldiceanu. Extending
CHIP in order to solve complex scheduling and placement problems.
Mathl. Comput. Modelling, 17(7):57–73, 1993.
57. Philippe Baptiste, Claude Le Pape, and Laurent Péridy. Global

constraints for partials CSPs: A case-study of resource and due date con-
straints. In Michael Maher and Jean-François Puget, editors, Principles and

Practice of Constraint Pro- gramming — CP98, pages 87–101. Springer-
Verlag LNCS 1520, 1998.
58. Jean-Charles Régin. Arc consistency for global cardinality
constraints with costs. In Joxan Jaffar, editor, Principles and Practice of

Constraint Programming — CP’99, pages 390–404. Springer-Verlag
LNCS 1713, 1999.
59. Linda G. Shapiro and Robert M. Haralick. Structural descrip-

tions and inexact matching. IEEE Transactions Pattern Analysis Machine
Intelligence, 3:504–519, 1981.
60. Eugene C. Freuder and Richard J. Wallace. Partial constraint
satisfaction. Arti- ficial Intelligence, 58:21–70, 1992.

61. Hélène Fargier and Jérôme Lang. Uncertainty in constraint sat-
isfaction prob- lems: a probabilistic approach. In Symbolic and Quanti-
tative Approaches to Reasoning and Uncertainty, European Conference

ECSQARU’93, pages 97–104. Springer-Verlag LNCS 747, 1993.
62. Thomas Schiex. Possibilistic constraint satisfaction problems or
“How to han- dle soft constraints?”. In 8th International Conference on

Uncertainty in Artificial Intelligence, pages 268–275, Stanford, CA, July
1992.

160