On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study

Variable elimination is a general technique for constraint processing. It is often discarded because of its high space complexity. However, it can be extremely useful when combined with other techniques. In this paper we study the applicability of variable elimination to the challenging problem of finding still-lifes. We illustrate several alternatives: variable elimination as a stand-alone algorithm, interleaved with search, and as a source of good quality lower bounds. We show that these techniques are the best known option both theoretically and empirically. In our experiments we have been able to solve the n = 20 instance, which is far beyond reach with alternative approaches.

[1]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[2]  Rina Dechter,et al.  Topological parameters for time-space tradeoff , 1996, Artif. Intell..

[3]  Rina Dechter,et al.  Mini-buckets: A general scheme for bounded inference , 2003, JACM.

[4]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[5]  Javier Larrosa,et al.  Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems , 2003, Constraints.

[6]  Tuomas Sandholm,et al.  An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.

[7]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[8]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[9]  Simon de Givry,et al.  Solving Max-SAT as Weighted CSP , 2003, CP.

[10]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[11]  Rina Dechter,et al.  A general scheme for automatic generation of search heuristics from specification dependencies , 2001, Artif. Intell..

[12]  Michael A. Trick,et al.  Constraint Programming and Hybrid Formulations for Three Life Designs , 2004, Ann. Oper. Res..

[13]  Gérard Verfaillie,et al.  Earth Observation Satellite Management , 1999, Constraints.

[14]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[15]  Kalev Kask.  New Search Heuristics for Max-CSP , 2000, CP.

[16]  Thomas Schiex,et al.  On the Complexity of Compact Coalitional Games , 2009, IJCAI.

[17]  Barbara M. Smith.  A Dual Graph Translation of a Problem in 'Life' , 2002, CP.

[18]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..