Abstract
Computational problems from many different application areas can be seen as constraint satisfaction problems (CSPs). For example, the problems of scheduling a collection of tasks, or interpreting a visual image, or laying out a silicon chip, can all be seen in this way. Solving a CSP consists of finding an assignment of values to variables such that all the constraints are satisfied. If such assignment (called solution to a CSP) is found, we said that the CSP is globally consistent.
Our aim in this paper is to maintain the global consistency of a constraint satisfaction problem involving temporal constraints during constraint restriction i.e. anytime a new constraint is added. This problem is of practical relevance since it is often required to check whether a solution to a CSP continues to be a solution when a new constraint is added and if not, whether a new solution satisfying the old and new constraints can be found.
The method that we will present here is based on constraint propagation and checks whether the existence of a solution is maintained anytime a new constraint is added. The new constraint is then accepted if the consistency of the problem is maintained and it is rejected otherwise. Experimental tests performed on randomly generated temporal constraint problems demonstrate the efficiency of our method to deal, in a dynamic environment, with large size problems.
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
Mouhoub, M., Charpillet, F., Haton, J.: Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning. Constraints: An International Journal 2 (1998) 151–164, Kluwer Academic Publishers
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49 (1991) 61–95
Meiri, I.: Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence 87 (1996) 343–385
Mouhoub, M., Yip, J.: Dynamic CSPs for Interval-based Temporal Reasoning. In: Fifteenth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE-2002), Cairns, Australia (2002) To appear.
Zhang, Y., Yap, R.H.C.: Making ac-3 an optimal algorithm. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI’01), Seattle, WA (2001) 316–321
Bessière, C., Régin, J.C.: Refining the basic constraint propagation algorithm. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI’01), Seattle, WA (2001) 309–315
Bessière, C.: Arc-consistency in dynamic constraint satisfaction problems. In: AAAI’91, Anaheim, CA (1991) 221–226
Debruyne, R.: Les algorithmes d’arc-consistance dans les csp dynamiques. Revue d’Intelligence Artificielle 9 (1995) 239–267
Neuveu, B., Berlandier”, P.: Maintaining Arc Consistency through Constraint Retraction. In: ICTAI’94. (1994) 426–431
Allen, J.: Maintaining knowledge about temporal intervals. CACM 26 (1983) 832–843
van Beek, P., Manchak, D.W.: The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research 4 (1996) 1–18
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mouhoub, M. (2003). Maintaining Global Consistency of Temporal Constraints in a Dynamic Environment. In: Chung, P.W.H., Hinde, C., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2003. Lecture Notes in Computer Science(), vol 2718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45034-3_79
Download citation
DOI: https://doi.org/10.1007/3-540-45034-3_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40455-2
Online ISBN: 978-3-540-45034-4
eBook Packages: Springer Book Archive