Summary
In a dynamic constraint satisfaction problem (dynamic CSP),we can add a new constraint to the constraint network (a restriction) or delete an old constraint (a relaxation) at any time. Therefore, incrementality is crucial for solving a dynamic CSP since we do not want to resolve the whole constraint system from scratch whenever a restriction or a relaxation occurs. In this paper, we propose an algorithm that can handle incremental constraint retraction in dynamic CSPs over real intervals. Basing on the hierarchical arc-consistency technique for disjoint real intervals developed by G. Sidebottom and W.S. Havens, we extent the proposed algorithm to be the one dealing with constraint deletion in dynamic CSPs over disjoint real intervals. The extended algorithm makes incremental deletion of constraints over disjoint real intervals a feasible task that can be efficiently implemented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bessiere, C.: Arc-consistency in Dynamic Constraint Satisfaction Problems. In: Proc. of AAAI'91, 221–226 (1991)
Codognet, P., Diaz, D. and Rossi, P.: Constraint Retraction in FD, In: Proc. of 16th Conf. on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, Dec., 168–179 (1996)
Davis, E.: Constraint Propagation with Interval Labels. Artificial Intelligence, 32, 281–331 (1987)
Debruyne, R.: Arc-consistency in Dynamic CSPs is no more Prohibitive. In: Proc. 8th Conference on Tools with Artificial Intelligence (TAI'96), 299–306 (1996)
Geordet, Y, Codognet, P. and Rossi, F.: Constraint Retraction in clp(FD): Formal Framework and Performance Results. Constraints, an International Journal 4(1):5–42 (1999)
Hyvonen, E.: Constraint Reasoning based on Interval Arithemetic: The Tolerance Propagation Approach. Artificial Intelligence, 58, 71–112 (1992)
Jussien, N., Debruyne, R., and Boizumault, P.: Maintaining Arc-consistency within Dynamic Backtracking. In: Principles and Practice of Constraint Programming CP 2000, No. 1894, Lecture Notes in Computer Science, Springer-Verlag, 249–261 (2000).
Lhomme, O.: Consistency Techniques for Numeric CSPs. In: Proc. IJCAI'93, 232–238 (1993)
Moore, R.E.: Interval Analysis, Englewood Cliffs, New Jersey, Prentice-Hall (1966)
Sidebottom, G., Havens, W.S.: Hierarchical Arc Consistency for Disjoint Real Intervals in Constraint Logic Programming. In: Proc. of Post-conference Workshop on Constraint Logic Programming Systems: Design and Applications, Washington D.C., USA, Nov., 120–150 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anh, D.T. (2005). Constraint Retraction for Dynamic Constraint Satisfaction Problems over Disjoint Real Intervals. In: Bock, H.G., Phu, H.X., Kostina, E., Rannacher, R. (eds) Modeling, Simulation and Optimization of Complex Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27170-8_1
Download citation
DOI: https://doi.org/10.1007/3-540-27170-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23027-4
Online ISBN: 978-3-540-27170-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)