Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bennaceur2001 H. Bennaceur and M-S. Affane. Combining Domain Partition and Local Consistencies: An efficient filtering technique. LIPN report, 2001.
H. Bennaceur. Partial Consistency for Constraint Satisfaction Problems. In Proc. of the ECAI, pages 120–125, Amesterdam, Netherlands, 1994.
P. Berlandier. Improving Domain Filtering Using Restricted Path Consistency. In Proc. of the IEEE CAIA, Los Angeles, CA, USA, 1995.
C. Bessiére. Arc-consistency and arc-consistency again. Artificial Intelligence Journal, 65 (1):179–190, 1994.
R. Debruyne and C. Bessiére. Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In Proc. of IJCAI, Nagoya, Japan, 1997.
E.C. Freuder and D. Elfe. Neighborhood Inverse Consistency Preprocessing. In Proc. of the AAAI, pages 202–208, Portland, OR, USA, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bennaceur, H., Affane, MS. (2001). Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_39
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive