Abstract
Constraint propagation algorithms vary in the strength of propagation they apply. This paper investigates a simple configuration for adaptive propagation—the process of varying the strength of propagation to reflect the dynamics of search. We focus on two propagation methods, Arc Consistency (AC) and Forward Checking (FC). AC-based algorithms apply a stronger form of propagation than FC-based algorithms; they invest greater computational effort to detect inconsistent values earlier. The relative payoff of maintaining AC during search as against FC may vary for different constraints and for different intermediate search states. We present a scheme for Adaptive Arc Propagation (AAP) that allows the flexible combination of the two methods. Metalevel reasoning and heuristics are used to dynamically distribute propagation effort between the two. One instance of AAP, Anti-Functional Reduction (AFR), is described in detail here. AFR achieves precisely the same propagation as a pure AC algorithm while significantly improving its average performance. The strategy is to gradually reduce the scope of AC propagation during backtrack search to exclude those arcs that may be subsequently handled as effectively by FC. Experimental results confirm the power of AFR and the validity of adaptive propagation in general.
Preview
Unable to display preview. Download preview PDF.
References
C. Bessiere. Arc-consistency and arc-consistency again. Artificial Intelligence 65:179–190, 1994.
C. Bessiére, E. Freuder, and J-C. Régin. Using inference to reduce arc consistency computation. In IJCAI-95, pages 592–598, Montréal, August 1995.
ECLiPSe version 3.4 user manual, July. Technical report, ECRC, 1995.
H. El Sakkout. Extending finite domain propagation for repair. Technical report, IC-Parc, 1995.
E.C. Freuder. Using metalevel knowledge to reduce constraint checking. In Constraint Processing: Selected Papers from the ECAI'94 Workshop. Springer, 1995.
S.W. Golomb and L.D. Baumert. Backtrack programming. Journal of the ACM, 12:516–524, 1965.
O. Hansson and A. Mayer. A decision-theoretic scheduler for space telescope applications. In Intelligent Scheduling. Morgan Kaufmann, 1994.
R.M. Haralick and G.L. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–314, October 1980.
A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.
R. Mohr and T.C. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225–233, 1986.
D. Sabin and E.C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In ECAI-94-11th European Conference on Artificial Intelligence, pages 125–129, Amsterdam, August 1994.
B.M. Smith and S. A. Grant. Sparse constraint graphs and exceptionally hard problems. In IJCAI-95, pages 646–651, Montréal, August 1995.
Andrew B. Philips Steven Minton, Mark D. Johnston and Philip Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161–205, 1992. Minconfict heuristic, CSPs.
Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
P. Van Hentenryck, Y. Deville, and C. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57:291–321, 1992.
R.J. Wallace. Why ac-3 is almost always better than ac-4 for establishing arc consistency in csps. In IJCAI-95, pages 592–598, Montréal, August 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El Sakkout, H., Wallace, M.G., Richards, E.B. (1996). An instance of adaptive constraint propagation. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_73
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive