Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency
The constraint propagation process is a powerful tool for solving constraint satisfaction problems (CSPs). We propose a filtering technique which exploits at best this tool in order to improve the pruning efficiency. This technique, combining domain partition and arc consistency, generalizes and improves the pruning efficiency of the arc consistency, and the singleton arc consistency filtering techniques. The presented empirical results show the gain brought by this technique.
Unable to display preview. Download preview PDF.
- [Bennaceur and Affane 2001]Bennaceur2001 H. Bennaceur and M-S. Affane. Combining Domain Partition and Local Consistencies: An efficient filtering technique. LIPN report, 2001.Google Scholar
- [Bennaceur 1994]H. Bennaceur. Partial Consistency for Constraint Satisfaction Problems. In Proc. of the ECAI, pages 120–125, Amesterdam, Netherlands, 1994.Google Scholar
- [Berlandier 1995]P. Berlandier. Improving Domain Filtering Using Restricted Path Consistency. In Proc. of the IEEE CAIA, Los Angeles, CA, USA, 1995.Google Scholar
- [Bessiére 1994]
- [Debruyne and Bessiére 1997]R. Debruyne and C. Bessiére. Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In Proc. of IJCAI, Nagoya, Japan, 1997.Google Scholar
- [Freuder and Elfe 1996]E.C. Freuder and D. Elfe. Neighborhood Inverse Consistency Preprocessing. In Proc. of the AAAI, pages 202–208, Portland, OR, USA, 1996.Google Scholar