Advertisement

Towards Solver-Independent Propagators

  • Jean-Noël Monette
  • Pierre Flener
  • Justin Pearson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7514)

Abstract

We present an extension to indexicals to describe propagators for global constraints. The resulting language is compiled into actual propagators for different solvers, and is solver-independent. In addition, we show how this high-level description eases the proof of propagator properties, such as correctness and monotonicity. Experimental results show that propagators compiled from their indexical descriptions are sometimes not significantly slower than built-in propagators of Gecode. Therefore, our language can be used for the rapid prototyping of new global constraints.

Keywords

Constraint Programming Global Constraint Propagator Description Current Domain Propagator Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Achterberg, T.: SCIP: Solving constraint integer programs. Mathematical Programming Computation 1, 1–41 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Ågren, M., Flener, P., Pearson, J.: Inferring Variable Conflicts for Local Search. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 665–669. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Beldiceanu, N., Carlsson, M., Flener, P., Pearson, J.: On the reification of global constraints. Tech. Rep. T2012:02, Swedish Institute of Computer Science (February 2012), http://soda.swedish-ict.se/view/sicsreport/
  4. 4.
    Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog, 2nd edn. (revision a). Tech. Rep. T2012:03, Swedish Institute of Computer Science (February 2012), http://soda.swedish-ict.se/view/sicsreport/
  5. 5.
    Carlson, B., Carlsson, M., Diaz, D.: Entailment of finite domain constraints. In: Proceedings of ICLP 1994, pp. 339–353. MIT Press (1994)Google Scholar
  6. 6.
    Carlsson, M., Ottosson, G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. In: Glaser, H., Hartel, P., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191–206. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  7. 7.
    CHOCO: An open source Java CP library, http://www.emn.fr/z-info/choco-solver/
  8. 8.
    Choi, C.W., Lee, J.H.M., Stuckey, P.J.: Removing propagation redundant constraints in redundant modeling. ACM Transactions on Computational Logic 8(4) (2007)Google Scholar
  9. 9.
    Dao, T.B.H., Lallouet, A., Legtchenko, A., Martin, L.: Indexical-Based Solver Learning. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 541–555. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. 10.
    Dynadec, Dynamic Decision Technologies Inc.: Comet tutorial, v2.0 (2009), http://dynadec.com/
  11. 11.
    Frühwirth, T.W.: Theory and practice of constraint handling rules. Journal of Logic Programming 37(1-3), 95–138 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Gecode Team: Gecode: A generic constraint development environment (2006), http://www.gecode.org/
  13. 13.
    Gent, I.P., Jefferson, C., Miguel, I.: Watched Literals for Constraint Propagation in Minion. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 182–197. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    JaCoP: Java constraint programming solver, http://jacop.osolpro.com/
  15. 15.
    Mohr, R., Henderson, T.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1986)CrossRefGoogle Scholar
  16. 16.
    Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints 14, 357–391 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Parr, T.J.: Enforcing strict model-view separation in template engines. In: Proceedings of the 13th International Conference on the World Wide Web, pp. 224–233. ACM (2004)Google Scholar
  18. 18.
    Parr, T.J.: The Definitive ANTLR Reference: Building Domain-Specific Languages. The Pragmatic Bookshelf (2007)Google Scholar
  19. 19.
    Régin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Hayes-Roth, B., Korf, R.E. (eds.) Proceedings of AAAI 1994, pp. 362–367. AAAI Press (1994)Google Scholar
  20. 20.
    Richaud, G., Lorca, X., Jussien, N.: A portable and efficient implementation of global constraints: The tree constraint case. In: Proceedings of CICLOPS 2007, pp. 44–56 (2007)Google Scholar
  21. 21.
  22. 22.
    Schulte, C., Stuckey, P.J.: Speeding Up Constraint Propagation. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 619–633. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  23. 23.
    Sidebottom, G., Havens, W.S.: Nicolog: A simple yet powerful cc(FD) language. Journal of Automated Reasoning 17, 371–403 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Tack, G., Schulte, C., Smolka, G.: Generating Propagators for Finite Set Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 575–589. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  25. 25.
    Van Hentenryck, P., Deville, Y.: The cardinality operator: A new logical connective for constraint logic programming. In: Proceedings of ICLP 1991, pp. 745–759 (1991)Google Scholar
  26. 26.
    Van Hentenryck, P., Michel, L.: Differentiable Invariants. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 604–619. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  27. 27.
    Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(FD). Tech. Rep. CS-93-02, Brown University, Providence, USA (January 1993), revised version in Journal of Logic Programming 37(1-3), 293–316 (1998). Based on the unpublished manuscript Constraint Processing in cc(FD) (1991)Google Scholar
  28. 28.
    Zhou, N.F.: Programming finite-domain constraint propagators in action rules. Theory and Practice of Logic Programming 6, 483–507 (2006)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jean-Noël Monette
    • 1
  • Pierre Flener
    • 1
  • Justin Pearson
    • 1
  1. 1.Department of Information TechnologyUppsala UniversityUppsalaSweden

Personalised recommendations