Please use this identifier to cite or link to this item:
Title: Applying Ad-hoc global constraints with the case constraint to still-life
Authors: Cheng, K.C.K.
Yap, R.H.C. 
Keywords: Ad-hoc constraint
Binary decision diagram
Non-binary constraint
Still-life problem
Issue Date: 2006
Citation: Cheng, K.C.K., Yap, R.H.C. (2006). Applying Ad-hoc global constraints with the case constraint to still-life. Constraints 11 (2-3) : 91-114. ScholarBank@NUS Repository.
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 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 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. © Springer Science + Business Media, LLC 2006.
Source Title: Constraints
ISSN: 13837133
DOI: 10.1007/s10601-006-8058-9
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 13, 2020


checked on Jan 13, 2020

Page view(s)

checked on Dec 30, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.