Light Algorithms for Maintaining Max-RPC During Search
Résumé
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.
Fichier principal
maxrpcrm.pdf (260.55 Ko)
Télécharger le fichier
200-30-15-onepass-filt.eps (22.41 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Format | Autre |
---|
Loading...