Abstract
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraints may outweigh the gain of reduction in search space. In fact, many of the constraints in redundant modelling are not only logically redundant but also propagation redundant and hence cannot further reduce search space. We give general theorems for proving propagation redundancy of one constraint with respect to channelling constraints and constraints in the other model. We define a broad form of channelling constraints that are covered by our approach. We illustrate, using problems from CSPLib (http://www.csplib.org/), how detecting and removing propagation redundant constraints can significantly speed up solving behaviour.
We thank the anonymous referees for their constructive comments. The work described in this paper was substantially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region (Project no. CUHK4183/00E).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdennadher, S., Rigotti, C.: Automatic generation of rule-based solvers for intentionally defined constraints. IJAIT 11(2), 283–302 (2002)
Apt, K., Monfroy, E.: Constraint programming viewed as rule-based programming. Theory and Practice of Logic Programming 1(6), 713–750 (2001)
Bessiére, C., Régin, J.: Arc consistency for general constraint networks: preliminary results. In: IJCAI 1997 pp. 398–404 (1997)
Cheng, B., et al.: Increasing constraint propagation by redundant modelling: an experience report. Constraints 4(2), 167–192 (1999)
Choi, C.W., Lee, J.H.M., Stuckey, P. J.: Propagation Redundancy for Permutation Channel. In: IJCAI 2003 (to appear)
Hnich, B., Kiziltan, Z., Walsh, T.: Modelling a balanced academic curriculum problem. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 121–131. Springer, Heidelberg (2002)
Smith, B.M.: Modelling a permutation problem. Research Report 2000.18, School of Computer Studies, University of Leeds (2000)
Smith, B.M.: Dual models in constraint programming. Research Report 2001.02, School of Computer Studies, University of Leeds (2001)
Walsh, T.: Permutation problems and channelling constraints. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 377–391. Springer, Heidelberg (2001)
Brand, S.: Anote on redundant rules in rule-based constraint programming. In: Recent Advances in Constraints, pp. 109–120 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, C.W., Lee, J.H.M., Stuckey, P.J. (2003). Propagation Redundancy in Redundant Modelling. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive