Advertisement

Constraints

, Volume 11, Issue 2–3, pp 91–114 | Cite as

Applying Ad-hoc Global Constraints with the \({\tt case}\) Constraint to Still-Life

  • Kenil C. K. Cheng
  • Roland H. C. YapEmail author
Article

Abstract

The Still-Life problem is challenging for CP techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this paper, we show how ad hoc global \({\tt case}\) constraints can be customized to construct various models to provide much stronger propagation with CP solvers. Since we use custom ad hoc constraints of high arity where the number of tuples to define the constraint are large, the actual constraint representation becomes important to avoid excessive space consumption. We demonstrate how to use BDDs to construct good representations for the \({\tt 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 paper shows an extensive example of how to systematically build models using different kinds of ad hoc constraints. It also demonstrates the solving potential of ad hoc global constraints.

Keywords

Modeling Binary decision diagram Still-life problem Ad-hoc constraint Non-binary constraint 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beldiceanu, N. (2000). Global constraints as graph properties on structured networks of elementary constraints of the same type. TR T2000-01, SICS.Google Scholar
  2. 2.
    Bessière, C., & Règin, J.-C. (1997). Arc consistency for general constraint networks: Preliminary results. In International Joint Conference on Artificial Intelligence (IJCAI), (pp. 398–404).Google Scholar
  3. 3.
    Bosch, R., & Trick, M. (2004). Constraint programming and hybrid formulations for three Life designs. Annals of Operations Research, 130, 41–56.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bryant, R. E. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35(8), 667–691.MathSciNetGoogle Scholar
  5. 5.
    Carlsson, M., et al., (2005). SICStus Prolog User’s Manual. Swedish Institute of Computer Science, release 3.12.1 edition. ISBN 91-630-3648-7.Google Scholar
  6. 6.
    Cheng, C. K., Lee, J. H. M., & Stuckey, P. J. (2003). Box constraint collections for ad-hoc constraints. In Principles and Practice of Constraint Programming (CP), (pp. 214–228).Google Scholar
  7. 7.
    Clarke, E. M., Grumberg, O., & Peled, D. A. (1999). Model Checking. The MIT Press.Google Scholar
  8. 8.
    Dao, T. B. H., Lallouet, A., Legtchenko, A., & Martin, L. (2002). Indexical-based solver learning. In Principles and Practice of Constraint Programming (CP), (pp. 541–555). (September).Google Scholar
  9. 9.
    Gardner, M. (1970). The fantastic combinations of John Conway’s new solitaire game. Scientific American, 223, 120–123.CrossRefGoogle Scholar
  10. 10.
    Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In International Joint Conference on Artificial Intelligence (IJCAI).Google Scholar
  11. 11.
    Larrosa, J., Morancho, E., & Niso, D. (2005). On the practical applicability of bucket elimination: Still-life as a case study. Journal of Artificial Intelligence Research, 23, 21–440.Google Scholar
  12. 12.
    Petrie, K. E., Smith, B. M., & Yorke-Smith, N. (2004). Dynamic symmetry breaking in constraint programming and linear programming hybrids. In European Starting AI Researcher Symp.Google Scholar
  13. 13.
    Smith, B. M. (2002). A dual graph translation of a problem in ‘life’. In Principles and Practice of Constraint Programming (CP), (pp. 402–414).Google Scholar
  14. 14.
    Smith, B. M., & Sturdy, P. (2005). Value ordering for finding all solutions. In International Joint Conference on Artificial Intelligence (IJCAI), (pp. 311–316).Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.National University of Singapore, School of ComputingSingaporeSingapore

Personalised recommendations