An experimental study of reasoning with sequences of point events

  • R. Wetprasit
  • A. Sattar
  • M. Beaumont
Reasoning (Temporal Reasoning, Event Calculus)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1531)


Interval and point algebras are two influential frameworks to model an interval and point based temporal entities. However, in many real world situations we often encounter recurring events that include multiple points, multiple intervals or combinations of points and intervals. Recently, point-based frameworks (MPE [9] and GMPE [10]) for representing and reasoning with sequences of point events have been proposed. These frameworks include new algorithms for solving reasoning tasks with an improved complexity. However, no empirical investigation has been made yet. This paper presents an experimental study of these two frameworks. In this study, we present the design of experiments, implementation of the algorithms, and an empirical performance analysis. Our results indicate that the MPE and GMPE frameworks are not only expressively richer, but also perform better than the traditional approaches to temporal reasoning.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Allen. Maintaining knowledge about temporal intervals. Communication of the ACM, 26(11):832–843, 1983.MATHCrossRefGoogle Scholar
  2. 2.
    A. Gerevini and L. Schubert. On point-based temporal disjointness (reseach note). Artificial Intelligence, 70(1):347–361, 1994.MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    L. al Khatib. Reasoning with Non-Convex Time Intervals. PhD thesis, Florida Institute of Technology, Melbourne, Florida, 1994. Scholar
  4. 4.
    A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.MATHCrossRefGoogle Scholar
  5. 5.
    B. Nebel. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ord-horn class. Constraints, 1:175–190, 1997.MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    P. van Beek and R. Cohen. Exact and approximate reasoning about temporal relations. Computational Intelligence, 6:132–144, 1990.Google Scholar
  7. 7.
    P. van Beek and D.W. Manchak. The design and an experimental analysis of algorithms for temporal reasoning. Journal of AI Research, 4:1–18, 1996.MATHGoogle Scholar
  8. 8.
    M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proceedings of the 5th National Conference in Artificial Intelligence (AAAI-86), pages 377–382, Philadelphia, PA, 1986.Google Scholar
  9. 9.
    R. Wetprasit, A. Sattar, and L. Khatib. Reasoning with multi-point events. In Lecture Notes in Artificial Intelligence 1081; Advances in AI, Proceedings of the 11th biennial conference on Artificial Intelligence (CSCSI-96), pages 26–40, Ontario, Canada, 1996.Google Scholar
  10. 10.
    R. Wetprasit, A. Sattar, and L. Khatib. A generalized framework for reasoning with multipoint events. In Lecture Notes in Computer Science 1345; Advances in Computing Science, Proceedings of the 3rd Asian Computing Science Conference (ASIAN-97), pages 121–135, Kathmandu, Nepal, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • R. Wetprasit
    • 1
  • A. Sattar
    • 1
  • M. Beaumont
    • 1
  1. 1.Knowledge Representation and Reasoning Unit School of Computing and Information TechnologyGriffith UniversityBrisbaneAustralia

Personalised recommendations