Abstract
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 MDDc algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bessière, C., Régin, J.-C.: Arc consistency for general constraint networks: Preliminary results. In: IJCAI (1), pp. 398–404 (1997)
Carlsson, M.: Filtering for the case constraint. Talk given at the advanced school on global constraints (2006)
Cheng, K., Yap, R.: An mdd-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15, 265–304 (2010)
Deville, Y., Van Hentenryck, P.: Domain Consistency with Forbidden Values. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 191–205. Springer, Heidelberg (2010)
Fleming, P.J., Wallace, J.J.: How not to lie with statistics: the correct way to summarize benchmark results. Commun. ACM 29(3), 218–221 (1986)
Gent, I.P., Jefferson, C., Miguel, I.: Watched Literals for Constraint Propagation in Minion. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 182–197. Springer, Heidelberg (2006)
Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: Proceedings of the Twenty Second Conference on Artificial Intelligence, pp. 191–197. AAAI Press (2007)
Katsirelos, G., Walsh, T.: A Compression Algorithm for Large Arity Extensional Constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 379–393. Springer, Heidelberg (2007)
Lecoutre, C.: Instances of the Constraint Solver Competition, http://www.cril.fr/~lecoutre/
Lecoutre, C.: Constraint Networks: Techniques and Algorithms. ISTE/Wiley (2009)
Lecoutre, C.: Str2: optimized simple tabular reduction for table constraints. Constraints 16, 341–371 (2011)
Lecoutre, C., Szymanek, R.: Generalized Arc Consistency for Positive Table Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 284–298. Springer, Heidelberg (2006)
Lhomme, O.: Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 209–224. Springer, Heidelberg (2004)
Lhomme, O., Régin, J.-C.: A fast arc consistency algorithm for n-ary constraints. In: Proceedings of the Nationnal Conference on Artificial Intelligence, pp. 405–410. AAAI Press (2005)
Perron, L., Furnon, V.: or-tools, http://code.google.com/p/or-tools
Régin, J.-C.: Improving the expressiveness of table constraints. In: Proceedings of Workshop ModRef 2011 at CP 2011 (2011)
Ullmann, J.R.: Partition search for non-binary constraint satisfaction. Inf. Sci. 177(18), 3639–3678 (2007)
Van Hentenryck, P., Deville, Y., Teng, C.-M.: A generic arc-consistency algorithm and its specializations. Artif. Intell. 57(2-3), 291–321 (1992)
Van Hentenryck, P., Ramachandran, V.: Backtracking without Trailing in CLP(\(\Re_{lin}\)). ACM Transactions on Programming Languages and Systems 17(4), 635–671 (1995)
Wallace, R.: Factor Analytic Studies of CSP Heuristics. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 712–726. Springer, Heidelberg (2005)
Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artif. Intell. 171(8-9), 514–534 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mairy, JB., Van Hentenryck, P., Deville, Y. (2012). An Optimal Filtering Algorithm for Table Constraints. In: Milano, M. (eds) Principles and Practice of Constraint Programming. CP 2012. Lecture Notes in Computer Science, vol 7514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33558-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-33558-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33557-0
Online ISBN: 978-3-642-33558-7
eBook Packages: Computer ScienceComputer Science (R0)