Abstract
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where the satisfying tuples are read from a database. The arity of these constraints may be large. A generic GAC algorithm for such a constraint requires time exponential in the arity of the constraint to maintain GAC, but Bessière and Régin showed in [1] that for the case of allowed tuples, GAC can be enforced in time proportional to the number of allowed tuples, using the algorithm GAC-Schema.
We introduce a more compact representation for a set of tuples, which allows a potentially exponential reduction in the space needed to represent the satisfying tuples and exponential reduction in the time needed to enforce GAC. We show that this representation can be constructed from a decision tree that represents the original tuples and demonstrate that it does in practice produce a significantly shorter description of the constraint. We also show that this representation can be efficiently used in existing algorithms and can be used to improve GAC-Schema further. Finally, we show that this method can be used to improve the complexity of enforcing GAC on a table constraint defined in terms of forbidden tuples.
NICTA is funded by the Australian Government’s Department of Communications, Information Technology and the Arts and the Australian Research Council through Backing Australia’s Ability and the ICT Centre of Excellence program. Thanks to Fahiem Bacchus and Nina Narodytska for their insightful comments.
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: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, Nagoya, Japan, pp. 398–404 (1997)
Carlsson, M.: Filtering for the case constraint. Talk given at Advanced School on Global Constraints, Samos, Greece (2006)
Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, Springer, Heidelberg (2001)
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 (to appear, 2007)
Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is np-complete. Information Processing Letters 5(1), 15–17 (1976)
Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: Proceedings of the Twentieth National Conference on Artificial Intelligence (2005)
Lecoutre, C., Hemery, F.: A study of residual supports in arc consistency. In: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, pp. 125–130 (2007)
Lecoutre, C., Szymanek, R.: Generalized arc consistency for positive table constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204. Springer, Heidelberg (2006)
Lhomme, O., Régin, J.-C.: A fast arc consistency algorithm for n-ary constraints. In: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005) (2005)
Quinlan, J.: Induction of decision trees. Machine Learning 1, 81–106 (1986)
Quinlan, J.: Programs for Machine Learning. Morgan Kaurmann Publishers, San Francisco (1993)
Régin, J.-C.: AC-*: A configurable, generic and adaptive arc consistency algorithm. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 505–519. Springer, Heidelberg (2005)
van Dongen, M., Lecoutre, C., Wallace, R., Zhang, Y.: 2005 CSP solver competition. In: van Dongen, M. (ed.) Second International Workshop on Constraint Propagation and Implementation (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katsirelos, G., Walsh, T. (2007). A Compression Algorithm for Large Arity Extensional Constraints. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)