Optimization of Simple Tabular Reduction for Table Constraints

9 years 11 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to compress their representation. We show that simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of supports, is very often the most efficient practical approach to enforce generalized arc consistency within MAC. We also describe an optimization of STR which allows limiting the number of operations related to validity checking or search of supports. Interestingly enough, this optimization makes STR potentially r times faster where r is the arity of the constraint(s). The results of an extensive experimentation that we have conducted with respect to random and structured instances indicate that the optimized algorithm we propose is usually around twice as fast as the original STR and can be up to one order of magnitude faster than previous state-of-the-art algori...
Christophe Lecoutre
Added 18 Oct 2010
Updated 18 Oct 2010
Type Conference
Year 2008
Where CP
Authors Christophe Lecoutre
Comments (0)