Skip to main content
SpringerLink
Log in

Interval constraint logic programming

  • Conference paper
  • First Online:
Constraint Programming: Basics and Trends (TCS School 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 910))

Included in the following conference series:

Abstract

In this paper, we present an overview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate n-ary relations over IR with Cartesian products of intervals whose bounds are taken in a finite subset of IR. Variables represent real values whose domains are intervals defined in the same manner. Narrowing operators are defined from approximations. These operators compute, from an interval and a relation, a set included in the initial interval. Sets of constraints are then processed thanks to a local consistency algorithm pruning at each step values from initial intervals. This algorithm is shown to be correct and to terminate, on the basis of a certain number of properties of narrowing operators. We focus here on the description of the general framework based on approximations, on its application to interval constraint solving over continuous and discrete quantities, we establish a strong ling between approximations and local consistency notions and show that arc-consistency is an instance of the approximation framework. We finally describe recent work on different variants of the initial algorithm proposed by John Cleary and developped by W. Older and A. Vellino which have been proposed in this context. These variants address four particular points: generalization of the constraint language, improvement of domain reductions, efficiency of the computation and finally, cooperation with other solvers. Some open questions are also identified.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Alefeld and J. Herzberger. Introduction to Internal Computations. Academic Press, 1983.

    Google Scholar 

  2. J. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 26, pp842–843, 1983.

    Google Scholar 

  3. F. Benhamou and A. Colmerauer (eds.) Constraint Logic Programming: Selected Research, MIT Press, 1993.

    Google Scholar 

  4. F. Benhamou and J.L. Massat. Boolean Pseudo-Equations in Constraint Logic Programming, Proceedings of ICLP'93, MIT Press, pp 517–531, Budapest, Hungary, 1993.

    Google Scholar 

  5. F. Benhamou and W. Older. Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Logic Programming, 1994. (Submitted).

    Google Scholar 

  6. F. Benhamou, W. Older and A. Vellino. Interval Constraint Solving. INTERVALS '94, collection of abstracts, St Petersburgh, Russia, 1994.

    Google Scholar 

  7. F. Benhamou, D. MacAllester and P. Van Hentenryck. CLP(Intervals) revisited. Proceedings of ILPS'94, Ithaca, NY, USA, 1994.

    Google Scholar 

  8. H. Beringer, B. De Backer Combinatorial problem solving in Constraint Logic Programming with cooperating Solvers. In Logic Programming: Formal Methods and Practical Applications, C. Beierle and L. Plumer eds., Elsevier Science Publishers, 1994.

    Google Scholar 

  9. P. Bouvier, J.L. Massat, S. N'Dong, Touraivane, E. Vetillard Performance Evaluation of the Prince Prototype Deliverable WP2-3/R6, Esprit Project PRINCE 5246, 1994.

    Google Scholar 

  10. A. Bundy. A generalized interval package and its semantic checking. ACM Trans. on Mathematical Systems, 10 (4), p 397–409, 1984.

    Google Scholar 

  11. C.K. Chiu and J.H.M. Lee. Towards Practical Interval Constraint Solving in Logic Programming. Proceedings of ILPS'94, Ithaca, NY, USA, 1994.

    Google Scholar 

  12. J.G. Cleary. Logical Arithmetic. Future Generation Computing Systems, 2(2), p 125–149, 1987.

    Google Scholar 

  13. A. Colmerauer. An Introduction to Prolog III. Communications of the ACM, 33(7):69, 1990.

    Google Scholar 

  14. A. Colmerauer. Naive Solving of Non-linear Constraints, Constraint Logic Programming: Selected Research, F. Benhamou and A. Colmerauer (eds.), MIT Press, pages 89–112, 1993.

    Google Scholar 

  15. A. Colmerauer. Résolution approchée de contraintes par produits cartésiens d'ensembles privilégiés. Working paper, 1994.

    Google Scholar 

  16. A. Colmerauer. A legal framework for discussing approximate solving of Constraints. INTERVALS'94, collection of abstracts, St Petersburgh, Russia, 1994.

    Google Scholar 

  17. E. Davis. Constraint Propagation with Interval Labels. Artificial Intelligence, 32:281–331, 1987.

    Google Scholar 

  18. J.E. Dennis and R.B. Schnabel. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice Hall, Englewood Cliffs, New Jersey, 1983.

    Google Scholar 

  19. M. Dincbas, H. Simonis and P. Van Hentenryck Extending Equation Solving and Constraints Handling in Logic Programming. Proc. Colloquium CREAS MCC, Austin, Texas, 1987.

    Google Scholar 

  20. E.R. Hansen and R.I. Greenberg. An Interval Newton Method. Appl. Math. Comput., 12:89–98, 1983.

    Google Scholar 

  21. E.R. Hansen and S. Sengupta. Bounding Solutions of Systems of Equations Using Interval Analysis. BIT, 21:203–211, 1981.

    Google Scholar 

  22. H. Hong. RISC-CLP(Real): Logic programming with Non-linear constraints over the Reals Constraint Logic Programming: Selected Research, F. Benhamou and A. Colmerauer, eds. MIT Press, 1993.

    Google Scholar 

  23. H. Hong and V. Stahl. Safe Starting Regions by Fixed Points and Tightening. Submitted for Publication, November 1993.

    Google Scholar 

  24. E. Hyvönen. Constraint Reasoning Based on Interval Arithmetic. In Proceedings of 11th IJCAI, pp 193–198, Morgan-Kaufmann publishers, 1989.

    Google Scholar 

  25. E. Hyvönen. Constraint Reasoning Based on Interval Arithmetic. The Tolerance Propagation Approach. Artificial Intelligence, 58, pp 71–112, 1992.

    Google Scholar 

  26. E. Hyvönen, S. De Pascale and A. Lehtola. Interval Constraint Programming in C++. Constraint Programming, B. Mayoh, E. Tyugu and J. Penjam eds., NATO ASI series, Series F, Vol. 1, Springer-Verlag, pp 350–366, 1994.

    Google Scholar 

  27. IEEE Standard for Binary Floating-point Arithmetic. ANSI/IEEE Std 754-1985, Institute of Electrical and Electronics Engineers, NYC, NY, USA.

    Google Scholar 

  28. INTERLOG 1.0: User's guide (in french). Dassault Electronique, 55 Quai M. Dassault, 92214 Saint Cloud, France.

    Google Scholar 

  29. Constraint Propagation with Interval Labels. Artificial Intelligence, 32, pp 281–331, 1987.

    Google Scholar 

  30. J. Jaffar and J.L. Lassez, Constraint Logic Programming. Proc. POPL, ACM, 1987.

    Google Scholar 

  31. J. Jaffar, S. Michaylov, P. J. Stuckey and R. H. C. Yap, The CLP(R) Language and System ACM Transactions on Programming Languages and Systems, Vol. 14, no 3, pages 339–395, 1992.

    Google Scholar 

  32. J. Jaffar and M. Maher, Constraint Logic Programming: a Survey Journal of Logic Programming, Vol. 19/20, pages 503–581, 1994.

    Google Scholar 

  33. R. Krawczyk. Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing, 4: 187–201, 1985.

    Google Scholar 

  34. P.B. Ladkin and A. Reinefeld. Effective Solution of Qualitative Interval Constraint Problems. Artificial Intelligence, 57, pp 107–124, 1992.

    Google Scholar 

  35. J.H.M. Lee and M.H. van Emden. Adapting CLP(R) to Floating-Point Arithmetic. Proceedings of FGCSC, Tokyo, Japan, 1992.

    Google Scholar 

  36. J.H.M. Lee and M.H. van Emden. Interval Computation as Deduction in CHIP. Journal of Logic Programming, 16(3–4):255–276, 1993.

    Google Scholar 

  37. O. Lhomme. Consistency Techniques for Numeric CSPs. Proceedings of the 13th IJCAI, 1993.

    Google Scholar 

  38. A.K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99–118, 1977.

    Google Scholar 

  39. U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science, 7(2):95–132, 1974.

    Google Scholar 

  40. R.E. Moore. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1966.

    Google Scholar 

  41. J.J. More and M.Y. Cosnard. Numerical Solution of Nonlinear Equations. ACM Transactions on Mathematical Software, 5:64–85, 1979.

    Google Scholar 

  42. W. Older and A. Vellino, “Extending Prolog with Constraint Arithmetic on Real Intervals”, in Proceedings of the Canadian Conference on Electrical and Computer Engineering, 1990.

    Google Scholar 

  43. W. Older and A. Vellino. Constraint Arithmetic on Real Intervals. In Constraint Logic Programming: Selected Papers, F. Benhamou & A. Colmerauer eds., The MIT Press, Cambridge, MA, 1993.

    Google Scholar 

  44. W. Older and F. Benhamou. Programming in CLP(BNR). In PPCP'94, Newport, RI (USA), 1993.

    Google Scholar 

  45. L.B. Rall. Automatic Differentiation: Techniques and Applications. Springer Lectures Notes in Computer Science, Springer Verlag, New York, 1981.

    Google Scholar 

  46. G. Sidebottom and W. havens. Hierarchical Arc Consistency Applied to Numeric Processing in Constraint Logic Programming. Computational Intelligence, 8(4), 1992.

    Google Scholar 

  47. M.H. Van Emden The Compatibility Operator for Real Intervals, Herbrand Universes and Finite Domains Research Report, University of Victoria, Canada, 1994.

    Google Scholar 

  48. P. Van Hentenryck. Constraint Satisfaction in Logic Programming MIT Press, Cambridge, 1989.

    Google Scholar 

  49. P. Van Hentenryck, V. Saraswat, and Y. Deville. The Design, Implementation, and Evaluation of the Constraint Language cc(FD). Technical Report, Brown University, December 1992.

    Google Scholar 

  50. P. Van Hentenryck and Yves Deville. The Cardinality Operator: A new Logical Connective for Constraint Logic Programming Constraint Logic Programming: Selected Research, F. Benhamou and A. Colmerauer (eds.), MIT Press, pages 383–403, 1993.

    Google Scholar 

  51. W. Walster. Philosophy and practicalities of Interval Arithmetic. Reliability in Computing, pp 309–323, Academic Press, 1988.

    Google Scholar 

  52. J.H. Wilkinson. The algebraic Eigenvalue Problem, Oxford University Press, 1965.

    Google Scholar 

  53. J. Zhou. Approximate Solving of y=cos(x) and Other Real Constraints by Cartesian Product of Intervals. Technical Report, LIM, University of Marseilles, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale d'Orléans I.I.I.A., Université d'Orléans, Rue Léonard de Vinci, B.P. 6759, 45067, Orleans Cedex 2, France

    Frédéric Benhamou

Authors
  1. Frédéric Benhamou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Podelski

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benhamou, F. (1995). Interval constraint logic programming. In: Podelski, A. (eds) Constraint Programming: Basics and Trends. TCS School 1994. Lecture Notes in Computer Science, vol 910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59155-9_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-59155-9_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59155-9

  • Online ISBN: 978-3-540-49200-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation