Optimal and Efficient Filtering Algorithms for Table Constraints

Select |


Mairy, Jean-Baptiste; Van Hentenryck, Pascal; Deville, Yves


Journal Article





Filtering algorithms for table constraints can be classified in two categories: constraint-based and value-based. In the constraint-based approaches, the propagation queue only contains information on the constraints that must be reconsidered. For the value-based approaches, the propagation queue also contains information on the removed values. This paper proposes five efficient value-based algorithms for table constraints. Two of them (AC5TCOpt-Tr and AC5TCOpt-Sparse) are proved to have an optimal time complexity of O(r·t+r·d) per table constraint. Substantial experimental results are presented. An empirical analysis is conducted on the effect of the arity of the tables. The experiments show that our propagators are the best when the arity of the table is 3 or 4. Indeed, on instances containing only binary constraints, our algorithms are outperformed by classical AC algorithm AC3rm. AC3rm is dedicated to binary constraints. However, all our algorithms outperform existing state-of-the-art constraint based STR2+ and MDD c and the optimal value-based STR3 algorithms on those instances. On instances with small arity tables (up to arity 4), all our algorithms are generally faster than STR2+, MDD c and than STR3. AC5TCOpt-Sparse is globally the best propagator on those benchmarks. On benchmarks containing large arity tables (arity 5 or more), each of the three existing state-of-the-art algorithms is the winning strategy on one different benchmark.

Data61; NICTA




Mairy, Jean-Baptiste; Van Hentenryck, Pascal; Deville, Yves. Optimal and Efficient Filtering Algorithms for Table Constraints. Constraints. 2014-01-01; 19(1):77-120. https://doi.org/10.1007/s10601-013-9156-0

Loading citation data...

Citation counts
(Requires subscription to view)