Evaluation of Length-Lex Set Variables

This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier work and two novel technical contributions: a generic filtering algorithm which automatically pushes ordering constraints into symmetric binary constraints with only a logarithmic overhead and an adaptation of symmetry-breaking constraints from 0/1 matrices to the length-lex ordering. The experimental results indicate that the length-lex representation for set variables is very effective and robust on traditional set-CSPs benchmarks.

• Type: Conference
• Year: 2009
• Where: CP
• Authors: Justin Yip, Pascal Van Hentenryck
• Keywords: CP 2009, Programming Languages, Set Variables, Symmetric Binary Constraints, Symmetry-breaking Constraints