Abstract
Max Restricted Path Consistency (maxRPC) is a promising domain filtering consistency for binary constraints. In existing algorithms, the process of searching for PC-witnesses requires most constraint checks. And the computing speed of this process significantly affects the efficiency of the whole algorithm. In this paper, we propose a new method based on bitwise operations to speed up the computations of this process. Two algorithms maxRPCbit and maxRPCbit + rm utilizing this new method are proposed. Both algorithms and their light versions outperform the best ones among existing algorithms by a large margin. Significantly, our experiments, which compare the search algorithms applying light maxRPC with the one maintaining arc consistency, demonstrate that maxRPC is a much more promising filtering technique than what we thought.
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
Debruyne, R., Bessière, C.: From restricted path consistency to max-restricted path consistency. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 312–326. Springer, Heidelberg (1997)
Debruyne, R., Bessière, C.: Domain Filtering Consistencies. JAIR 14, 205–230 (2001)
Grandoni, F., Italiano, G.: Improved Algorithms for Max-Restricted Path Consistency. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 858–862. Springer, Heidelberg (2003)
Vion, J., Debruyne, R.: Light Algorithms for Maintaining Max-RPC During Search. In: Proceedings of SARA 2009 (2009)
Likitvivatanavong, C., Zhang, Y., Shannon, S., Bowen, J., Freuder, E.: Arc Consistency during Search. In: Proceedings of IJCAI 2007, pp. 137–142 (2007)
Lecoutre, C., And Hemery, F.: A Study of Residual Supports in Arc Consistency. In: Proceedings of IJCAI 2007, pp. 125–130 (2007)
Balafoutis, T., Paparrizou, A., Stergiou, K., Walsh, T.: Improving the performance of maxRPC. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 69–83. Springer, Heidelberg (2010)
Lecoutre, C., Vion, J.: Enforcing Arc Consistency using Bitwise Operations. Constraint Programming Letters 2, 21–35 (2008)
Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by weighting Constraints. In: Proceedings of ECAI 2004, pp. 146–150 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, J., Li, Z., Zhang, L., Geng, X. (2011). MaxRPC Algorithms Based on Bitwise Operations. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)