Abstract
We study in this paper the problem of global consistency for qualitative constraints networks (QCNs) of the Point Algebra (PA) and the Interval Algebra (IA). In particular, we consider the subclass \(\mathcal{S}_{\sf PA}\) corresponding to the set of relations of PA except the relations { < , = } and { > , = }, and the subclass \(\mathcal{S}_{\sf IA}\) corresponding to pointizable relations of IA one can express by means of relations of \(\mathcal{S}_{\sf PA}\). We prove that path-consistency implies global consistency for QCNs defined on these subclasses. Moreover, we show that with the subclasses corresponding to convex relations, there are unique greatest subclasses of PA and IA containing singleton relations satisfying this property.
This is a preview of subscription content, log in via an institution to check access.
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
Allen, J.F.: An interval-based representation of temporal knowledge. In: Proceedings of the 7th International Joint Conference on Artificial Intelligence (IJCAI 1981), pp. 221–226 (1981)
Bessière, C., Isli, A., Ligozat, G.: Global consistency in interval algebra networks: Tractable subclasses. In: Proc. of the 12th European Conf. on Artificial Intelli. (ECAI 1996), pp. 3–7 (1996)
Freuder, E.C.: Synthesizing constraint expressions. Commun. ACM 21(11), 958–966 (1978)
Koubarakis, M.: From local to global consistency in temporal constraint networks. Theoritical Computer Science 173(1), 89–112 (1997)
Krokhin, A.A., Jeavons, P., Jonsson, P.: Reasoning about temporal relations: The tractable subalgebras of allen’s interval algebra. Journal of ACM 50(5), 591–640 (2003)
Ligozat, G.: A New Proof of Tractability for ORD-Horn Relations. In: Proc. of the Thirteenth National Conference on Artificial Intelligence (AAAI 1996), vol. 1, pp. 395–401 (1996)
Ligozat, G., Renz, J.: What Is a Qualitative Calculus? A General Framework. In: Zhang, C., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 53–64. Springer, Heidelberg (2004)
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)
Nökel, K. (ed.): Temporally Distributed Symptoms in Technical Diagnosis. LNCS, vol. 517, pp. 1–184. Springer, Heidelberg (1991)
van Beek, P.: Reasoning About Qualitative Temporal Information. Artificial Intelligence 58(1-3), 297–326 (1992)
Van Beek, P., Cohen, R.: Exact and approximate reasoning about temporal relations. Computational Intelligence 6, 133–144 (1990)
Vilain, M., Kautz, H.: Constraint Propagation Algorithms for Temporal Reasoning. In: Proceedings of the Fifth National Conf. on Artificial Intelligence (AAAI 1986), pp. 377–382 (1986)
Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: a revised report. In: Qualitative Reasoning about Physical Systems, pp. 372–381 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amaneddine, N., Condotta, JF. (2012). From Path-Consistency to Global Consistency in Temporal Qualitative Constraint Networks. In: Ramsay, A., Agre, G. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2012. Lecture Notes in Computer Science(), vol 7557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33185-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-33185-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33184-8
Online ISBN: 978-3-642-33185-5
eBook Packages: Computer ScienceComputer Science (R0)