Abstract
In this paper we consider the consistency problem for qualitative constraint networks representing temporal or spatial information. The most efficient method for solving this problem consists in a search algorithm using, on the one hand, the weak composition closure method as a local propagation method, and on the other hand, a decomposition of the constraints into subrelations of a tractable set. We extend this algorithm with the notion of eligibility and the notion of frozen constraints. The first concept allows to characterise constraints which will not be considered during the search. The second one allows to freeze constraints in order to avoid unnecessary updates.
This work is supported in part by the CNRS and the ANR “Planevo” project nJC05_41940.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allen, a.J.F.: An interval-based representation of temporal knowledge. In: Proc. of the Seventh Int. Joint Conf. on Artificial Intelligence (IJCAI 1981), pp. 221–226 (1981)
Ligozat, G.: Reasoning about cardinal directions. Journal of Visual Languages and Computing 1(9), 23–44 (1998)
Ladkin, P.B., Reinefeld, A.: Effective solution of qualitative interval constraint problems. Artificial Intelligence 57(1), 105–124 (1992)
Nebel, B.: Solving hard qualitative temporal reasoning problems: Evaluating the efficienty of using the ORD-Horn class. In: Proceeding of the Twelfth Conference on Artificial Intelligence (ECAI 1996) (1996)
Renz, J., Nebel, B.: Efficient methods for qualitative spatial reasoning (1998)
Beek, P.V., Manchak, D.W.: The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research 4, 1–18 (1996)
Condotta, J.F., Ligozat, G., Saade, M.: The QAT: A Qualitative Algebra Toolkit. In: Proceedings of the thirteenth international conference on Temporal Representation an Reasoning (TIME 2006), Hungary (2006)
Nebel, B., Bürckert, H.J.: Reasoning About Temporal Relations: A Maximal Tractable Subclass of Allen’s Interval Algebra. Journal of the ACM 42(1), 43–66 (1995)
Ligozat, G.: A New Proof of Tractability for ORD-Horn Relations. In: Proc. of the Thirteenth Nat. Conference on Artificial Intelligence (AAAI 1996), vol. 1, pp. 395–401 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Condotta, JF., Ligozat, G., Saade, M. (2007). Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)