Abstract
Constraint retraction, while being certainly a very convenient feature in many situations, is usually not provided in current constraint programming environments. In this paper we describe how constraint retraction can be incorporated in the FD constraint solver and we evaluate its behavior within the clp(FD) system. Experimental results on usual benchmarks and also on classes of problems of increasing connectivity show that in almost all cases the use of our retraction algorithm provides great speed-up with respect to standard methods while not slowing down the clp(FD) system when no retraction is performed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Carlson, M. Carlsson and S. Janson. Finite Domain Constraints in AKL(FD). Proc. ILPS'94, MIT Press, 1994.
P. Codognet and D. Diaz. Compiling Constraints in clp(FD). JLP, 1996.
P. Codognet, F. Fages and T. Sola. A meta-level compiler for CLP(FD) and its combination with 113. In CLP: Selected Research, A. Colmerauer, F. Benhamou (Eds.), MIT Press, 1993.
P. Codognet and F. Rossi. NMCC Programming: Constraint Enforcement and Retraction in CC Programming. Proc. ICLP'95, MIT Press, 1995.
P. Codognet, D. Diaz and F. Rossi. Constraint Retraction in FD. 16th Conf. on. Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag, LNCS 1116, 1996.
J. de Kleer. An assumption-based truth maintenance system. Artificial Intelligence 28, 1986.
J. Doyle. A Truth Maintenance System. Artificial Intelligence, vol. 12, 1979.
F. Fages, J. Fowler and T. Sola. A reactive CLP Scheme Proc. ICLP'95, Tokyo, 1995.
W. S. Havens. Intelligent Backtracking in the Echidna Constraint Logic Programming System. Research Rep. CSS-IS TR 92-12, Simon Fraser University, Vancouver, Canada, 1992.
ILOG SA. The Ilog Solver White Paper, April 1997.
J. Jaffar and J.L. Lassez. Constraint Logic Programming. Proc. POPL, ACM Press, 1987.
N. Jussien and P. Boizumault. Maintien de Déduction pour la Relaxation de Contraintes. Proc. of JFPLC'96, Clermont-Ferrand, 1996.
A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, vol.8, n.1, 1977.
F. Menezes, P. Barahona and P. Codognet. An Incremental Hierarchical Constraint Solver. In proceedings of PPCP'93, Newport, USA, April 93.
B. Neveu and P. Berlandier. Maintaining Arc Consistency through Constraint Retraction. Proc. TAI94, IEEE Press.
V.A. Saraswat. Concurrent Constraint Programming. MIT Press, 1993.
T. Schiex and Gérard Verfaillie. Nogood Recording for Static and Dynamic Constraint Satisfaction Problems. International Journal of Artificial Intelligence Tools, 1994.
E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
P. Van Hentenryck, Y. Deville and C-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57 (1992), pp 291–321.
P. Van Hentenryck, V. Saraswat and Y. Deville. Constraint processing in cc(FD). In Constraint Programming: Basics and Trends, A. Podelski (Ed.), LNCS 910, Springer Verlag 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Georget, Y., Codognet, P., Rossi, F. (1997). Implementing constraint retraction for finite domains. In: Shyamasundar, R.K., Ueda, K. (eds) Advances in Computing Science — ASIAN'97. ASIAN 1997. Lecture Notes in Computer Science, vol 1345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63875-X_49
Download citation
DOI: https://doi.org/10.1007/3-540-63875-X_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63875-9
Online ISBN: 978-3-540-69658-2
eBook Packages: Springer Book Archive