Global behaviour for complex constraints

  • Stéphane N'Dong
  • Michel Van Caneghem
Posters
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1118)

Keywords

Global Behaviour Primary Relation Complex Constraint Generation Computing System Classical Benchmark 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

References

  1. 1.
    F. Benhamou, Touraïvane. Prolog IV: langage et algorithmes. JFPL, 1995.Google Scholar
  2. 2.
    F. Benhamou, D. McAllester, P. Van Hentenryck. CLP (Intervals) revisited. ILPS, 1994.Google Scholar
  3. 3.
    J.G. Cleary. Logical arithmetic. Future generation computing systems. 1987.Google Scholar
  4. 4.
    E.R. Hansen, R.I. Greenberg. An interval Newton method. Appl. Math. Comput, 1983.Google Scholar
  5. 5.
    E.R. Hansen, S. Sengupta. Bounding solutions of systems of equations using interval analysis. BIT, 1981.Google Scholar
  6. 6.
    A.K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, Vol 8, No 1, 1977.Google Scholar
  7. 7.
    R.E. Moore. Interval analysis. Prentice-Hall, Englewood Cliffs, 1966.Google Scholar
  8. 8.
    W. Older, F. Benhamou. Programming in CLP(BNR). PPCP, 1993.Google Scholar
  9. 9.
    W. Older, A.J. Velino. Constraint arithmetic on real interval in CLP. Selected research. F. Benhamou and A. Colmerauer, eds MIT Press, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Stéphane N'Dong
    • 1
  • Michel Van Caneghem
    • 1
  1. 1.LIM - URA CNRS 1787 Case 901-163Marseille Cedex 9France

Personalised recommendations