Abstract
Table constraints define an arbitrary constraint explicitly as a set of solutions (tuples) or non-solutions. Thus, space is proportional to number of tuples. Simple Tabular Reduction (STR), which dynamically reduces the table size by maintaining a table of only the valid tuples, has been shown to be efficient for enforcing Generalized Arc Consistency. The Cartesian product representation is another way of having a smaller table by compression. We investigate whether STR and the Cartesian product representation can work hand in hand. Our experiments show the compression-based STR can be faster once the tables compress well. Thus, the benefits of the STR2 and STR3 algorithms respectively are retained while consuming less space.
This work has been supported by grant MOE2012-T2-1-155.
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
Ullmann, J.R.: Partition Search for Non-binary Constraint Satisfaction. Information Science 177, 3639–3678 (2007)
Lecoutre, C.: STR2: Optimized Simple Tabular Reduction for Table Constraints. Constraints 16, 341–371 (2011)
Lecoutre, C., Likitvivatanavong, C., Yap, R.H.C.: A Path-Optimal GAC Algorithm for Table Constraints. In: Proceedings of the Twentieth European Conference on Artificial Intelligence (ECAI), pp. 510–515 (2012)
Cheng, K.C.K., Yap, R.H.C.: An MDD-based Generalized Arc Consistency Algorithm for Positive and Negative Table Constraints and Some Global Constraints. Constraints 15, 265–304 (2010)
Focacci, F., Milano, M.: Global Cut Framework for Removing Symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 77–92. Springer, Heidelberg (2001)
Katsirelos, G., Bacchus, F.: Generalized Nogoods in CSPs. In: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI), pp. 390–396 (2005)
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)
Gharbi, N., Hemery, F., Lecoutre, C., Roussel, O.: STR et Compression de Contraintes Tables. In: Journées Francophones de Programmation par Contraintes (JFPC), pp. 143–146 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, W., Yap, R.H.C. (2013). Optimizing STR Algorithms with Tuple Compression. In: Schulte, C. (eds) Principles and Practice of Constraint Programming. CP 2013. Lecture Notes in Computer Science, vol 8124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40627-0_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-40627-0_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40626-3
Online ISBN: 978-3-642-40627-0
eBook Packages: Computer ScienceComputer Science (R0)