Skip to main content

Ad-hoc Global Constraints for Life

  • Conference paper

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

Abstract

Still-life is a challenging problem for CP techniques. We show how to use the global case constraint to construct ad-hoc constraints which can provide stronger propagation than existing CP models. We also demonstrate how to use BDDs to construct good representations for the case constraint which is critical for efficiency. Our results seem comparable to hybrid CP/IP models even though we are only using propagation albeit on ad-hoc global constraints. This is rather promising since it shows the potential of ad-hoc global constraints to do better than IP global constraints.

Keywords

  • Integer Program
  • Directed Acyclic Graph
  • Constraint Programming
  • Global Constraint
  • Binary Decision Diagram

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11564751_16
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-32050-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   189.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gardner, M.: The fantastic combinations of John Conway’s new solitaire game. Scientific American 223, 120–123 (1970)

    CrossRef  Google Scholar 

  2. Larrosa, J., Morancho, E., Niso, D.: On the practical applicability of bucket elimination: Still-life as a case study. Journal of Artificial Intelligence Research 23, 21–440 (2005)

    Google Scholar 

  3. Smith, B.M.: A dual graph translation of a problem in ‘life’. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 402–414. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  4. Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. In: Intl. Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR), pp. 77–91 (2002)

    Google Scholar 

  5. Bessière, C., Règin, J.C.: Arch consistency for general constraint networks: Preliminary results. In: Intl. Joint Conf. on Artificial Intelligence (IJCAI), pp. 398–404 (1997)

    Google Scholar 

  6. Barták, R.: Filtering algorithms for tabular constraints. In: Colloqium on Implementation of Constraint and Logic Programming Systems (CICLOPS), pp. 168–182 (2001)

    Google Scholar 

  7. Dao, T., 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)

    CrossRef  Google Scholar 

  8. Cheng, C.K., Lee, J.H.M., Stuckey, P.J.: Box constraint collections for adhoc constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 214–228. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  9. Beldiceanu, N.: Global constraints as graph properties on structured networks of elementary constraints of the same type. TR T2000-01, SICS (2000)

    Google Scholar 

  10. SICStus Prolog 3.12.1 manual (2005)

    Google Scholar 

  11. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp. 35, 667–691 (1986)

    CrossRef  Google Scholar 

  12. Petrie, K.E., Smith, B.M., Yorke-Smith, N.: Dynamic symmetry breaking in constraint programming and linear programming hybrids. In: European Starting AI Researcher Symp. (2004)

    Google Scholar 

  13. Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Intl. Joint Conf. on Artificial Intelligence (IJCAI) (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, K.C.K., Yap, R.H.C. (2005). Ad-hoc Global Constraints for Life. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_16

Download citation

  • DOI: https://doi.org/10.1007/11564751_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29238-8

  • Online ISBN: 978-3-540-32050-0

  • eBook Packages: Computer ScienceComputer Science (R0)