Skip to main content

An experimental study of reasoning with sequences of point events

  • Reasoning (Temporal Reasoning, Event Calculus)
  • Conference paper
  • First Online:
PRICAI’98: Topics in Artificial Intelligence (PRICAI 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1531))

Included in the following conference series:

  • 89 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Allen. Maintaining knowledge about temporal intervals. Communication of the ACM, 26(11):832–843, 1983.

    Article  MATH  Google Scholar 

  2. A. Gerevini and L. Schubert. On point-based temporal disjointness (reseach note). Artificial Intelligence, 70(1):347–361, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  3. L. al Khatib. Reasoning with Non-Convex Time Intervals. PhD thesis, Florida Institute of Technology, Melbourne, Florida, 1994. http://www.cs.fit.edu/~lina/dissertation.

    Google Scholar 

  4. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.

    Article  MATH  Google Scholar 

  5. B. Nebel. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ord-horn class. Constraints, 1:175–190, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. van Beek and R. Cohen. Exact and approximate reasoning about temporal relations. Computational Intelligence, 6:132–144, 1990.

    Google Scholar 

  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.

    MATH  Google Scholar 

  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. 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. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hing-Yan Lee Hiroshi Motoda

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wetprasit, R., Sattar, A., Beaumont, M. (1998). An experimental study of reasoning with sequences of point events. In: Lee, HY., Motoda, H. (eds) PRICAI’98: Topics in Artificial Intelligence. PRICAI 1998. Lecture Notes in Computer Science, vol 1531. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095280

Download citation

  • DOI: https://doi.org/10.1007/BFb0095280

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65271-7

  • Online ISBN: 978-3-540-49461-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics