Skip to main content

The Proper Treatment of Undefinedness in Constraint Languages

  • Conference paper

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

Abstract

Any sufficiently complex finite-domain constraint modelling language has the ability to express undefined values, for example division by zero, or array index out of bounds. This paper gives the first systematic treatment of undefinedness for finite-domain constraint languages. We present three alternative semantics for undefinedness, and for each of the semantics show how to map models that contain undefined expressions into equivalent models that do not. The resulting models can be implemented using existing constraint solving technology.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Wallace, M.: Constraint Logic Programming Using ECLiPSe. Cambridge University Press, Cambridge (2006)

    Book  Google Scholar 

  2. SWI Prolog (2009), http://www.swi-prolog.org/

  3. Intelligent Systems Laboratory: SICStus Prolog. Swedish Institute of Computer Science (2009), http://www.sics.se/isl/sicstuswww/site/index.html

  4. Van Hentenrcyk, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)

    Google Scholar 

  5. Nethercote, N., Stuckey, P., Becket, R., Brand, S., Duck, G., Tack, G.: Minizinc: Towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P.J., Garcia de la Banda, M., Wallace, M.: The design of the Zinc modelling language. Constraints 13, 229–267 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Frisch, A.M., Harvey, W., Jefferson, C., Hernández, B.M., Miguel, I.: Essence: A constraint language for specifying combinatorial problems. Constraints 13, 268–306 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Frisch, A.M., Grum, M., Jefferson, C., Martínez Hernández, B., Miguel, I.: The essence of Essence: A language for specifying combinatorial problems. In: Proc. of the 4th Int. Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pp. 73–88 (2005)

    Google Scholar 

  9. Kleene, S.C.: Introduction to Metamathematics. Van Nostrand, New York (1952)

    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

Frisch, A.M., Stuckey, P.J. (2009). The Proper Treatment of Undefinedness in Constraint Languages. 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_30

Download citation

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

  • 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