Skip to main content

A Comparative Study of Arithmetic Constraints on Integer Intervals

  • Conference paper
Recent Advances in Constraints (CSCLP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3010))

Abstract

We propose here a number of approaches to implement constraint propagation for arithmetic constraints on integer intervals. To this end we introduce integer interval arithmetic. Each approach is explained using appropriate proof rules that reduce the variable domains. We compare these approaches using a set of benchmarks.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R.: A proof theoretic view of constraint programming. Fundamenta Informaticae 33(3), 263–293 (1998), Available via http://arXiv.org/archive/cs/

    MathSciNet  Google Scholar 

  2. Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising hull and box consistency. In: Proceedings of the 16th International Conference on Logic Programming (ICLP 1999), pp. 230–244. MIT Press, Cambridge (1999)

    Google Scholar 

  3. Benhamou, F., Older, W.: Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming 32(1), 1–24

    Google Scholar 

  4. Granlund, T.: GNU MP, The GNU Multiple Precision Arithmetic Library, Edition 4.1.2. Swox AB (December 2002)

    Google Scholar 

  5. Harvey, W., Stuckey, P.J.: Improving linear constraint propagation by changing constraint representation. Constraints 8(2), 173–207 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hickey, T.J., Ju, Q., van Emden, M.H.: Interval arithmetic: from principles to implementation. Journal of the ACM 48(5), 1038–1068 (2001)

    Article  MathSciNet  Google Scholar 

  7. Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)

    MATH  Google Scholar 

  8. Ratz, D.: Inclusion isotone extended interval arithmetic. Technical report, University of Karlsruhe, Report No. D-76128 Karlsruhe (1996)

    Google Scholar 

  9. Schulte, C., Smolka, G.: Finite domain constraint programming in Oz. A tutorial, Version 1.2.4 (20020829) (August 2002), Available via http://www.mozart-oz.org/documentation/fdt/index.html

  10. Zoeteweij, P.: Coordination-based distributed constraint solving in DICE. In: Panda, B. (ed.) Proceedings of the 2003 ACM Symposium on Applied Computing, pp. 360–366 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Apt, K.R., Zoeteweij, P. (2004). A Comparative Study of Arithmetic Constraints on Integer Intervals. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds) Recent Advances in Constraints. CSCLP 2003. Lecture Notes in Computer Science(), vol 3010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24662-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24662-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21834-0

  • Online ISBN: 978-3-540-24662-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics