Abstract
The possibility of deleting a piece of information is very convenient in many programming frameworks. However, this feature is not available in constraint languages such as Constraint Logic Programming or Concurrent Constraint Programming, which allow only for a monotonic accumulation of constraints. This is mainly due to its high complexity and also to its non-monotonic nature, which would make such a system much more complex to reason with. In this paper we consider the CLP framework over FD (finite domain) constraints, and we propose an incremental algorithm which deletes a constraint from a set of FD constraints, while maintaining partial arc-consistency. The algorithm follows the chain of dependencies among variables which are set by the nature of the FD constraints, and by doing so it updates only the part of the constraint set which is affected by the deletion. This makes constraint deletion in FD a feasible task that can be efficiently implemented.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Aggoun and N. Beldiceanu. Overview of the CHIP Compiler System. In Constraint Logic Programming: Selected Research, A. Colmerauer and F. Benhamou (Eds.). MIT Press, 1993.
B. Carlson, M. Carlsson and S. Janson. Finite Domain Constraints in AKL(FD). In Proceedings of ILPS 94, MIT Press, 1994.
C. Codognet and P. Codognet. Non-deterministic Stream AND-Parallelism based on Intelligent Backtracking. In Proceedings of 6th ICLP, Lisbon, 1989. The MIT Press.
P. Codognet and D. Diaz. Compiling Constraints in clp(FD). Journal of Logic Programming, vol. 27(3), 1996.
P. Codognet, F. Fages and T. Sola. A meta-level compiler for CLP(FD) and its combination with intelligent backtracking. In Constraint Logic Programming: Selected Research, A. Colmerauer, F. Benhamou (Eds.), MIT Press, 1993.
D. Diaz and P. Codognet. A minimal extension of the WAM for CLP(FD). In proceedings of the 10th International Conference on Logic Programming, D. S. Warren (Ed.), Budapest, Hungary, MIT Press 1993.
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.
T. Huynh and K. Marriott. Incremental Constraint Deletion in Systems of Linear Constraints. Draft Report, IBM T. J. Watson Research Center, 1992.
J. Jaffar and J.L. Lassez. Constraint Logic Programming. In Proceedings of POPL '87, ACM Press, 1987.
A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, vol.8, n.1, 1977.
B. A. Nadel. Constraint Satisfaction Algorithms. Computational Intelligence 5 (1989).
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. Sola. Deduction Maintenance in Constraint Logic Programs. Ph.D. thesis, University of Paris XI, December 1995.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming, Logic Programming Series, The MIT Press, Cambridge, MA, 1989.
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. First version: Research Report, Brown University, Jan. 1992.
P. Van Hentenryck, Y. Deville and C-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57 (1992), pp 291–321.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Codognet, P., Diaz, D., Rossi, F. (1996). Constraint retraction in FD. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_47
Download citation
DOI: https://doi.org/10.1007/3-540-62034-6_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62034-1
Online ISBN: 978-3-540-49631-1
eBook Packages: Springer Book Archive