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

Authors:
Kenil C. Cheng;Roland H. Yap
Affiliations:
National University of Singapore, School of Computing, Singapore, Singapore;National University of Singapore, School of Computing, Singapore, Singapore
Venue:
Constraints
Year:
2006

Citing 7
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Model checking

Model checking
A Dual Graph Translation of a Problem in 'Life'

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Indexical-Based Solver Learning

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On the practical use of variable elimination in constraint optimization problems: 'still-life' as a case study

Journal of Artificial Intelligence Research
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Value ordering for finding all solutions

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Search space reduction and Russian Doll search

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms

Journal of Artificial Intelligence Research
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

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.