Ad-hoc global constraints for life

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 182-195

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

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; PROBLEM SOLVING;

BDD; CP TECHNIQUES; CP/IP MODELS; GLOBAL CONSTRAINTS;

CONSTRAINT THEORY;

EID: 33646192083     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_16     Document Type: Conference Paper

References (13)

1. Gardner, M.: The fantastic combinations of John Conway's new solitaire game. Scientific American 223 (1970) 120-123
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 (2005) 21-440
3. Smith, B.M.: A dual graph translation of a problem in 'life'. In: Principles and Practice of Constraint Programming (CP). (2002) 402-414
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). (2002) 7791
5. Bessière, C., Règin, J.C.: Arch consistency for general constraint networks: Preliminary results. In: Intl. Joint Conf. on Artificial Intelligence (IJCAI). (1997) 398-404
6. Barták, R.: Filtering algorithms for tabular constraints. In: Colloqium on Implementation of Constraint and Logic Programming Systems (CICLOPS). (2001) 168-182
7. Dao, T., Lallouet, A., Legtchenko, A., Martin, L.: Indexical-based solver learning. In: Principles and Practice of Constraint Programming (CP). (2002) 541-555
8. Cheng, C.K., Lee, J.H.M., Stuckey, P.J.: Box constraint collections for adhoc constraints. In: Principles and Practice of Constraint Programming (CP). (2003) 214-228
9. Beldiceanu, N.: Global constraints as graph properties on structured networks of elementary constraints of the same type. TR T2000-01, SICS (2000)
10. SICStus Prolog 3.12.1 manual. (2005)
11. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp. 35 (1986) 667-691
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)
13. Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Intl. Joint Conf. on Artificial Intelligence (IJCAI). (1995)