Abstract
In classical constraint satisfaction, combining mutually redundant models using channeling constraints is effective in increasing constraint propagation and reducing search space for many problems. In this paper, we investigate how to benefit the same for weighted constraint satisfaction problems (WCSPs), a common soft constraint framework for modeling optimization and over-constrained problems. First, we show how to generate a redundant WCSP model from an existing WCSP using generalized model induction. We then uncover why naively combining two WCSPs by posting channeling constraints as hard constraints and relying on the standard NC* and AC* propagation algorithms does not work well. Based on these observations, we propose m -NC* c and m-AC* c and their associated algorithms for effectively enforcing node and arc consistencies on a combined model with m sub-models. The two notions are strictly stronger than NC* and AC* respectively. Experimental results confirm that applying the 2-NC* c and 2-AC* c algorithms on combined models reduces more search space and runtime than applying the state-of-the-art AC*, FDAC*, and EDAC* algorithms on single models.
We thank the anonymous referees for their constructive comments. The work described in this paper was substantially supported by grants (CUHK4358/02E and CUHK4219/04E) from the Research Grants Council of Hong Kong SAR.
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
Cheng, B., Choi, K., Lee, J., Wu, J.: Increasing constraint propagation by redundant modeling: an experience report. Constraints 4(2), 167–192 (1999)
Schiex, T.: Arc consistency for soft constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 411–424. Springer, Heidelberg (2000)
Larrosa, J.: Node and arc consistency in weighted CSP. In: Proc. of AAAI 2002, pp. 48–53 (2002)
Law, Y., Lee, J.: Model induction: a new source of CSP model redundancy. In: Proc. of AAAI 2002, pp. 54–60 (2002)
Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted CSP. In: Proc. of IJCAI 2003, pp. 239–244 (2003)
de Givry, S., Heras, F., Zytnicki, M., Larrosa, J.: Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In: Proc. of IJCAI 2005, pp. 84–89 (2005)
Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: hard and easy problems. In: Proc. of IJCAI 1995, pp. 631–637 (1995)
Hnich, B., Smith, B., Walsh, T.: Dual modelling of permutation and injection problems. JAIR 21, 357–391 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Law, Y.C., Lee, J.H.M., Woo, M.H.C. (2006). Speeding Up Weighted Constraint Satisfaction Using Redundant Modeling. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_10
Download citation
DOI: https://doi.org/10.1007/11941439_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49787-5
Online ISBN: 978-3-540-49788-2
eBook Packages: Computer ScienceComputer Science (R0)