Skip to main content

Domain Views for Constraint Programming

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

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

Abstract

Traditional constraint-programming systems provide the concept of variable views which implement a view of the type y = f(x) by delegating operations on variable y to variable x. While the traditional support is limited to bound consistency, this paper offers views that support domain consistency without any limitations. This paper proposes the alternative concept of domain views which delegate all domain operations. Domain views preserve the benefits of variable views, simplify the implementation of value-based propagation, and also support non-injective views compositionally. Experimental results demonstrate the practical benefits of domain views. The paper also reveals a subtle interaction between views and the exploitation of constraint idempotence, which may lead to incomplete propagation.

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. Barendregt, H.P.: The Lambda Calculus – Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland (1984)

    Google Scholar 

  2. Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Glaser, H., Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191–206. Springer, Heidelberg (1997)

    Google Scholar 

  3. Dynadec, I.: Comet v2.1 user manual. Technical report, Providence, RI (2009)

    Google Scholar 

  4. Hentenryck, P.V., Saraswat, V., Deville, Y.: Constraint processing in cc(fd). Technical report (1992)

    Google Scholar 

  5. Ilog Solver 4.4. Reference Manual. Ilog SA, Gentilly, France (1998)

    Google Scholar 

  6. Lagerkvist, M.Z., Schulte, C.: Advisors for incremental propagation. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 409–422. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. 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 

  8. Schulte, C., Tack, G.: View-based propagator derivation. Constraints 18(1), 75–107 (2013)

    Article  MathSciNet  Google Scholar 

  9. Van Hentenryck, P., Deville, Y., Teng, C.: A Generic Arc Consistency Algorithm and Its Specializations. Artificial Intelligence 57(2-3) (1992)

    Google Scholar 

  10. Van Hentenryck, P., Michel, L.: The Objective-CP Optimization System. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 8–29. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Van Hentenryck, P., Michel, L. (2014). Domain Views for Constraint Programming. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10428-7_51

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10427-0

  • Online ISBN: 978-3-319-10428-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics