Abstract
Reasoning and acting within the time constraints of the real world are among the most fundamental notions of intelligence. Understanding the nature and structure of such constraints can help to find a satisfying solution or find a relaxation when no solution can be found. Given certain explicit temporal relationships between events, we may have the ability to infer additional relationships which are implicit in those given. For example, the transitivity of “before” and “contains” may allow inferring information regarding the sequence of events. Such inferences are essential in story understanding, planning and causal reasoning. Temporal information may be qualitative where events are represented by abstract time points and time intervals, and we process and deduce relationships between them, such as pairs intersecting each other, one preceding, following or containing another, etc. Other information may be quantitative where durations can be measured, precise time stamps may be available, or numerical methods can be applied to understand a specific time line of events. We will explore a variety of these topics.
This chapter is based on a talk given at the German–Israeli Minerva School in autumn 2009 at the University of Haifa in Israel.
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 subscriptionsNotes
- 1.
Cheverst, Taher and Fisher chapter “The Design, Deployment and Evaluation of Situated Display-Based Systems to Support Coordination and Community’ in this book.”
- 2.
In A 3 there are 23 – 1 = 7 disjunctions of which two are symmetric pairs to two others, namely < ∩ with ∩ > and < with >; thus, there are only five essentially different disjunctions; hence, 25 – 1 = 31 symmetric fragments to be considered.
- 3.
Kuflik, Boger and Zancanaro chapter “Analysis and Prediction of Museum Visitors’ Behavioral Pattern Types” in this book.
- 4.
Lin and Kraus chapter “From Research and Practice: Automated Negotiations with People” in this book.
- 5.
Robert J. Aumann: “Pure Science and Applied Science”. In: Rambam Maimonides Medical Journal 2(1):e0017 (2011).
References
Berthe Y. Choueiry and Lin Xu: An Efficient Consistency Algorithm for the Temporal Constraint Satisfaction Problem. In: AI Communications, vol. 17 (4), pp. 213–221. IOS Press (2004)
Rina Dechter: Constraint Processing. Morgan Kaufmann (2003)
Rina Dechter, Itay Meiri and Judea Pearl: Temporal constraint networks. In: Artificial Intelligence, vol. 49, pp. 61–95. Elsevier (1991)
Martin Charles Golumbic: Reasoning about time. In: Frederick Hoffman (ed.) Mathematical Aspects of Artificial Intelligence: Proc. Symposia in Applied Math, vol. 55, pp. 19–53 American Math. Society (1998)
Martin Charles Golumbic: Graph theoretic models for reasoning about time: In: Lecture Notes in Computer Science, vol. 3321, pp. 362–372. Springer (2004)
Martin Charles Golumbic and Ron Shamir: Complexity and algorithms for reasoning about time: a graph-theoretic approach. In: J. Assoc. Comput. Mach., vol. 40, pp. 1108–1133. ACM (1993)
Martin Charles Golumbic and Ann N. Trenk: Tolerance Graphs. Cambridge University Press (2004)
Andrei Krokhin, Peter Jeavons and Peter Jonsson: Reasoning about temporal relations: The tractable subalgebras of Allen’s interval algebra. In: J. Assoc. Comput. Mach., vol. 50, pp. 591–640. ACM (2003)
Bernhard Nebel and Hans-Jürgen Bürckert: Reasoning about temporal relations: a maximal tractable subclass of Allen’s interval algebra. In: J. Assoc. Comput. Mach., vol. 42, 43–66. ACM (2003)
Geetika Singla, Diane J. Cook, and Maureen Schmitter-Edgecombe: Incorporating temporal reasoning into activity recognition for smart home residents. In: Proc. of the AAAI Workshop on Spatial and Temporal Reasoning, pp. 53–61 (2008).
Marc B. Vilain and Henry A. Kautz: Constraint Propagation Algorithms for Temporal Reasoning. In: Proc. AAAI, pp. 377–382. (1986)
Marc B. Vilain, Henry A. Kautz and Peter van Beek: Constraint propagation algorithms for temporal reasoning: A revised report. In: Daniel S. Weld and Johan de Kleer (eds.) Readings in Qualitative Reasoning about Physical Systems, pp. 373–381. Morgan-Kaufman (1989)
Adam Brooks Webber: Proof of the interval satisfiability conjecture. In: Annals of Mathematics and Artificial Intelligence, vol. 15, pp. 231–238 (1995)
Lin Xu, Berthe Y. Choueiry: A new efficient algorithm for solving the simple temporal problem. In: 10th International Symposium on Temporal Representation and Reasoning/4th International Conference on Temporal Logic TIME, pp. 212–222 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Golumbic, M.C. (2012). Perspectives on Reasoning About Time. In: Krüger, A., Kuflik, T. (eds) Ubiquitous Display Environments. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27663-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-27663-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27662-0
Online ISBN: 978-3-642-27663-7
eBook Packages: Computer ScienceComputer Science (R0)