MaxRPC algorithms based on bitwise operations

  • Authors:

  • Jinsong Guo;Zhanshan Li;Liang Zhang;Xuena Geng

  • Affiliations:

  • Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education, Jilin University and College of Computer Science and Technology, Changchun, China;Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education, Jilin University and College of Computer Science and Technology, Changchun, China;Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education, Jilin University and College of Computer Science and Technology, Changchun, China;Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education, Jilin University and College of Computer Science and Technology, Changchun, China

  • Venue:
  • CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.