Applying Ad-hoc global constraints with the case constraint to still-life

Constraints

Volumn 11, Issue 2-3, 2006, Pages 91-114

  Cheng, Kenil C K ^a   Yap, Roland H C ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

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

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBLEM SOLVING;

AD-HOC CONSTRAINT; BINARY DECISION DIAGRAM; MODELING; NON-BINARY CONSTRAINT; STILL-LIFE PROBLEM;

CONSTRAINT THEORY;

EID: 33745219686     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-006-8058-9     Document Type: Conference Paper

References (14)

1. Beldiceanu, N. (2000). Global constraints as graph properties on structured networks of elementary constraints of the same type. TR T2000-01, SICS.
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).
3. Bosch, R., & Trick, M. (2004). Constraint programming and hybrid formulations for three Life designs. Annals of Operations Research, 130, 41-56.
4. Bryant, R. E. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35(8), 667-691.
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.
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).
7. Clarke, E. M., Grumberg, O., & Peled, D. A. (1999). Model Checking. The MIT Press.
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).
9. Gardner, M. (1970). The fantastic combinations of John Conway's new solitaire game. Scientific American, 223, 120-123.
10. Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In International Joint Conference on Artificial Intelligence (IJCAI).
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.
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.
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).
14. Smith, B. M., & Sturdy, P. (2005). Value ordering for finding all solutions. In International Joint Conference on Artificial Intelligence (IJCAI), (pp. 311-316).