Light Algorithms for Maintaining Max-RPC During Search

This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency dur- ing search with a minimal memory footprint and implementa- tion effort. Both are sub-optimal algorithms that make use of support residues, a backtrack-stable and highly efficient data structure which was successfully used to develop the state- of-the-art AC-3 rm algorithm. The two proposed algorithms, Max-RPC rm and L-Max-RPC rm are competitive with best, optimal Max-RPC algorithms, while being considerably sim- pler to implement. L-Max-RPC rm computes an approxima- tion of the Max-RPC consistency, which is guaranteed to be strictly stronger than AC with the same space complexity and better worst-case time complexity than Max-RPC rm . In prac- tice, the difference in filtering power between L-Max-RPC rm and standard Max-RPC is nearly indistinguishable on random problems. Max-RPC rm and L-Max-RPC rm are implemented into the Choco Constraint Solver through a strong consistency global constraint. This work opens new perspectives upon the development of strong consistency algorithms into con- straint solvers.