Skip to Main content Skip to Navigation
New interface
Conference papers

Light Algorithms for Maintaining Max-RPC During Search

Abstract : This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implementation 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-3rm algorithm. The two proposed algorithms, Max-RPCrm and L-Max-RPCrm are competitive with best, optimal Max-RPCalgorithms while being considerably simplier to implement. L-Max-RPCrm computes an approximation of the Max-RPC consistency, which is garanteed to be strictly stronger than AC with the same space complexity and better worst-case time complexity than Max-RPCrm. In practice, the difference in filtering power between L-Max-RPCrm and standard Max-RPC is nearly indistinguisable on random problems. Max-RPCrm and L-Max-RPCrm are implemented into the Choco Constraint Solver through a strong consistency global constraint. This work opens new perspective upon the development of strong consistency algorithms into constraint solvers.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Romuald Debruyne Connect in order to contact the contributor
Submitted on : Monday, May 10, 2010 - 12:54:05 PM
Last modification on : Wednesday, April 27, 2022 - 4:39:16 AM
Long-term archiving on: : Thursday, June 30, 2011 - 12:40:39 PM


  • HAL Id : hal-00482383, version 1


Julien Vion, Romuald Debruyne. Light Algorithms for Maintaining Max-RPC During Search. SARA-2009 Eighth Symposium on Abstraction, Reformulation, and Approximation, Aug 2009, Lake Arrowhead, CA, United States. pp.167-174. ⟨hal-00482383⟩



Record views


Files downloads