References
F. Benhamou, Touraïvane. Prolog IV: langage et algorithmes. JFPL, 1995.
F. Benhamou, D. McAllester, P. Van Hentenryck. CLP (Intervals) revisited. ILPS, 1994.
J.G. Cleary. Logical arithmetic. Future generation computing systems. 1987.
E.R. Hansen, R.I. Greenberg. An interval Newton method. Appl. Math. Comput, 1983.
E.R. Hansen, S. Sengupta. Bounding solutions of systems of equations using interval analysis. BIT, 1981.
A.K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, Vol 8, No 1, 1977.
R.E. Moore. Interval analysis. Prentice-Hall, Englewood Cliffs, 1966.
W. Older, F. Benhamou. Programming in CLP(BNR). PPCP, 1993.
W. Older, A.J. Velino. Constraint arithmetic on real interval in CLP. Selected research. F. Benhamou and A. Colmerauer, eds MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
N'Dong, S., Van Caneghem, M. (1996). Global behaviour for complex constraints. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_112
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive