Perspectives on Reasoning About Time

  • Martin Charles Golumbic
Part of the Cognitive Technologies book series (COGTECH)


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.


Temporal Information Braid Group Constraint Graph Temporal Reasoning Interval Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    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)Google Scholar
  2. 2.
    Rina Dechter: Constraint Processing. Morgan Kaufmann (2003)Google Scholar
  3. 3.
    Rina Dechter, Itay Meiri and Judea Pearl: Temporal constraint networks. In: Artificial Intelligence, vol. 49, pp. 61–95. Elsevier (1991)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Martin Charles Golumbic: Graph theoretic models for reasoning about time: In: Lecture Notes in Computer Science, vol. 3321, pp. 362–372. Springer (2004)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Martin Charles Golumbic and Ann N. Trenk: Tolerance Graphs. Cambridge University Press (2004)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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).Google Scholar
  11. 11.
    Marc B. Vilain and Henry A. Kautz: Constraint Propagation Algorithms for Temporal Reasoning. In: Proc. AAAI, pp. 377–382. (1986)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Adam Brooks Webber: Proof of the interval satisfiability conjecture. In: Annals of Mathematics and Artificial Intelligence, vol. 15, pp. 231–238 (1995)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.University of HaifaHaifaIsrael

Personalised recommendations