Abstract
Interval algebra of Allen [4] propose a set of relations which is particularly interesting on historical annotating tasks [1]. However, finding the feasible relations and consistent scenario has been shown to be NP-complete tasks for interval algebra networks [11,10]. For point algebra networks and a restricted class of interval algebra networks, some works propose efficient algorithms to resolve it. Nevertheless, these sets of relations (made of basic relation disjunctions) are not intuitive for describing historical scenarios. In this paper we propose a set of concrete relations for the annotator, and we formalize it in terms of temporal algebras. We then describe how our model can be matched with other ones to merge calculation efficiency and information suitability.
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
Accary, T., Bénel, A., Calabretto, S., Iacovella, A.: Confrontation de points de vue sur des corpus documentaires: Le cas de la modélisation du temps archéologique. In: Actes du 14éme Congrés Francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle [RFIA], pp. 197–205 (2004)
Allen, J.F.: Time and Time Again: The Many Ways to Represent Time. International Journal of Intelligent Systems 6(4), 341–355 (1991)
Allen, J.F.: Towards a general theory of action and time. Artificial Intelligence 23, 123–154 (1982)
Allen, J.F.: Maintaining Knowledge About Temporal Intervals. Communications of the ACM 26(11), 832–843 (1983)
Euzenat, J., Bessiére, C., et al.: Dossier Raisonnement Temporel et spatial. Bulletin de l’Association Française pour l’Intelligence Artificielle 29, 2–13 (1997)
Haton, J.P., Bouzid, N., Charpillet, F., et al.: Le Raisonnement en Intelligence Artificielle : Modéles, techniques et architectures pour les systémes à bases de connaissances. Inter Edition (ed.), pp. 183–229 (1991)
Ladkin, P.B., Maddux, R.: On Binary Constraint Networks. Technical Report, Kestrel Institute, Palo Alto, Calif. (1988)
Van Beek, P.: Reasoning about qualitative temporal information. Artificial Intelligence 58, 297–326 (1992)
Van Beek, P., Cohen, R.: Exact and approximate reasoning about temporal relation. Computational Intelligence 6, 132–144 (1990)
Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: A revised report. In: Weld, D.S., de Kleer, J. (eds.) Readings in Qualitative Reasoning about Physical Systems, pp. 373–381. Morgan Kaufmann, San Francisco (1989)
Vilain, M., Kautz, H.: Constraint propagation algorithms for temporal reasoning. In: Proceedings of the National Conference of the American Association for Artificial Intelligence (AAAI 1986), Philadelphia, Pa, pp. 377–382 (1986)
Zadeh, L.A.: Fuzzy sets. Information and Control 8, 338–353 (1965)
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
Accary-Barbier, T., Calabretto, S. (2005). Temporal Reasoning on Chronological Annotation. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds) MICAI 2005: Advances in Artificial Intelligence. MICAI 2005. Lecture Notes in Computer Science(), vol 3789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11579427_6
Download citation
DOI: https://doi.org/10.1007/11579427_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29896-0
Online ISBN: 978-3-540-31653-4
eBook Packages: Computer ScienceComputer Science (R0)