A new framework for reasoning about points, intervals and durations

  • Authors:

  • Arun K. Pujari;Abdul Sattar

  • Affiliations:

  • Artificial Intelligence Lab, Dept. of Computer & Information Sciences, University of Hyderabad, Hyderabad, India;Knowledge Representation and Reasoning Unit, School of Computing and Information Technology, Griffith University, Nathan, QLD, Australia

  • Venue:
  • IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new framework for reasoning about points, intervals and durations--Point Interval Duration Network (PIDN). The PIDN adequately handles both qualitative and quantitaive temporal information. We show that Interval Algebra, Point Algebra, TCSP, PDN and APDN become special cases of PIDN. The underlying algebraic structure of PIDN is closed under composition and intersection. Determinig consistency of P I DN is NP-Ilard. However, we identify some tractable subclasses of PIDN. We show that path consistency is not sufficient to ensure global consistency of the tractable subclasses of PIDN. We identify a subclass for which enforcing 4-consistency suffices to ensure the global consistency, and prove that this subclass is maximal for qualitative constraints. Our approach is based on the geometric interpretation of the domains of temporal objects. Interestingly, the classical Helly's Theorem of 1923 is used to prove the complexity for the tractable subclass.