Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. This paper proposes four efficient value-based algorithms for table constraints, meaning that the propagation queue also contains information on the removed values. One of these algorithms (AC5TC-Tr) is proved to have an optimal time complexity of O(r•t + r •d) per table constraint. Experimental results show that, on structured instances, all our algorithms are two or three times faster than the state of the art STR2+ and MDD c algorithms. © 2012 Springer-Verlag.
CITATION STYLE
Mairy, J. B., Van Hentenryck, P., & Deville, Y. (2012). An optimal filtering algorithm for table constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7514 LNCS, pp. 496–511). https://doi.org/10.1007/978-3-642-33558-7_37
Mendeley helps you to discover research relevant for your work.