Skip to main content

Hull Consistency under Monotonicity

  • Conference paper
Principles and Practice of Constraint Programming - CP 2009 (CP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5732))

Abstract

We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to each variable. This result holds including when variables have multiple occurrences in the expressions of the functions, which is usually a pitfall for interval-based contractors. For a given constraint, an optimal contractor can thus be enforced quickly under monotonicity and the practical significance of this theoretical result is illustrated on a simple example.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Alefeld, G., Mayer, G.: Interval Analysis: Theory and Applications. J. Comput. Appl. Math. 121(1-2), 421–464 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising Hull and Box Consistency. In: ICLP, pp. 230–244 (1999)

    Google Scholar 

  3. Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: Handbook of Constraint Programming, ch. 16, pp. 571–604. Elsevier, Amsterdam (2006)

    Chapter  Google Scholar 

  4. Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP(intervals) revisited. In: International Symposium on Logic programming, pp. 124–138. MIT Press, Cambridge (1994)

    Google Scholar 

  5. Benhamou, F., Older, W.J.: Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Logic Programming 32, 1–24 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cleary, J.G.: Logical Arithmetic. Future Computing Systems 2(2), 125–149 (1987)

    Google Scholar 

  7. Collavizza, H.: A Note on Partial Consistencies over Continuous Domains Solving Techniques. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 147–161. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Delobel, F., Collavizza, H., Rueher, M.: Comparing Partial Consistencies. Reliable Computing 5(3), 213–228 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Granvilliers, L., Benhamou, F.: Progress in the Solving of a Circuit Design Problem. Journal of Global Optimization 20(2), 155–168 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hansen, E.R.: Global Optimization using Interval Analysis. Marcel Dekker, New York (1992)

    MATH  Google Scholar 

  11. Hyvönen, E.: Constraint Reasoning Based on Interval Arithmetic. In: IJCAI, pp. 1193–1198 (1989)

    Google Scholar 

  12. Hyvönen, E.: Constraint Reasoning Based on Interval Arithmetic—The Tolerance Propagation Approach. Artificial Intelligence 58, 71–112 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  14. Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational complexity and feasibility of data processing and interval computations. Kluwer, Dordrecht (1997)

    MATH  Google Scholar 

  15. Lhomme, O.: Consistency Techniques for Numeric CSPs. In: IJCAI, pp. 232–238 (1993)

    Google Scholar 

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

    MATH  Google Scholar 

  17. Older, W.J., Vellino, A.: Extending Prolog with Constraint Arithmetic on Real Intervals. In: IEEE Canadian Conf. on Elec. and Comp. Engineering (1990)

    Google Scholar 

  18. Van Hentenryck, P., McAllester, D., Kapur, D.: Solving Polynomial Systems Using a Branch and Prune Approach. SIAM J. Numer. Anal. 34(2), 797–827 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chabert, G., Jaulin, L. (2009). Hull Consistency under Monotonicity. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04244-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04243-0

  • Online ISBN: 978-3-642-04244-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics