Skip to main content

Type Parametric Compilation of Algebraic Constraints

  • Conference paper
Progress in Artificial Intelligence (EPIA 2009)

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

Included in the following conference series:

Abstract

This paper addresses the problem of propagating constraints involving arbitrary algebraic expressions. We formally describe previous approaches to this problem and propose a new model that does not decompose the expression thus avoiding introducing auxiliary data structures. We show how this compilation model fits naturally in a popular programming language supporting type parametricity, yielding significant speedups with respect to previous models.

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. Apt, K.R., Zoeteweij, P.: A comparative study of arithmetic constraints on integer intervals. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.) CSCLP 2003. LNCS(LNAI), vol. 3010, pp. 1–24. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Bessiere, C.: Constraint Propagation. In: Handbook of Constraint Programming. Foundations of Artificial Intelligence, pp. 29–83. Elsevier Science, Amsterdam (2006)

    Chapter  Google Scholar 

  3. Carlson, B.: Compiling and executing finite domain constraints. PhD thesis, Uppsala University (1995)

    Google Scholar 

  4. Cheng, K.C.K., Yap, R.H.C.: Maintaining generalized arc consistency on ad hoc r-ary constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 509–523. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Choco. Choco constraint programming system (2003), http://www.emn.fr/x-info/choco-solver/doku.php?id=

  6. Correia, M., Barahona, P., Azevedo, F.: Casper: A programming environment for development and integration of constraint solvers. In: Azevedo, F. (ed.) Proceedings of the First International Workshop on Constraint Programming Beyond Finite Integer Domains, BeyondFD 2005 (2005)

    Google Scholar 

  7. Diaz, D., Codognet, P.: Design and implementation of the gnu prolog system. Journal of Functional and Logic Programming 2001(6) (October 2001)

    Google Scholar 

  8. ECLiPSe. ECLiPSe prolog (2008), http://www.eclipse-clp.org/

  9. Gecode. Gecode: Generic constraint development environment (2006), http://www.gecode.org

  10. Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: AAAI, pp. 191–197. AAAI Press, Menlo Park (2007)

    Google Scholar 

  11. Gent, I.P., Walsh, T.: Csplib: a benchmark library for constraints. Technical report, APES-09-1999 (1999), http://www.csplib.org/

  12. ILOG. Ilog solver 6.0: Reference manual, 2003.

    Google Scholar 

  13. Rossi, F., Van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier Science, Amsterdam (2006)

    MATH  Google Scholar 

  14. Schulte, C., Tack, G.R.: Views and iterators for generic constraint implementations. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol. 3978, pp. 118–132. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Schulte, C., Tack, G.R.: Perfect derived propagators. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 571–575. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. SICStus. SICStus Prolog 3.12 User’s Manual, 3.12 edn. (October 2006), http://www.sics.se/sicstus/

  17. Yuanlin, Z., Yap, R.H.C.: Arc consistency on n -ary monotonic and linear constraints. In: Principles and Practice of Constraint Programming, pp. 470–483 (2000)

    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

Correia, M., Barahona, P. (2009). Type Parametric Compilation of Algebraic Constraints. In: Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M. (eds) Progress in Artificial Intelligence. EPIA 2009. Lecture Notes in Computer Science(), vol 5816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04686-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04686-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04685-8

  • Online ISBN: 978-3-642-04686-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics