Convex Relations Between Time Intervals
We describe a fragment of Allen’s full algebra of time interval relations (the algebra of convex relations) that is useful for describing the dynamic behavior of technical systems. After an intuitive description of the fragment we give two formal definitions and prove that they are equivalent. This provides the basis for the major result of the paper: in a time net in which all interval relations are convex the test for the global consistency of the edge labelling can be carried out in polynomial time (in the general case it is NP-complete). This result makes convex interval relations an attractive candidate whereever qualitative reasoning about technical systems requires testing for global instead of local consistency.
KeywordsTechnical System Relation Algebra Left Endpoint Local Consistency Global Consistency
Unable to display preview. Download preview PDF.
- [Allen83]J.F. Allen: Maintaining Knowledge about Temporal Intervals, CACM 26(11), Nov.83Google Scholar
- [Allen/Hayes85]J.F. Allen, P.F. Hayes: A Common Sense Theory of Time, Proc.9th IJCAI, 1985Google Scholar
- [deKleer/Brown84]J. deKleer, J.S. Brown: A Qualitative Physics Based on Confluences, in: D.G. Bobrow (ed.): Qualitative Reasoning about Physical Systems, Amsterdam 1984Google Scholar
- [Forbus84]K.D.Forbes: Qualitative Process Theory, in:D.G.Bobrow (ed.): Qualitative Reasoning about Physical Systems, Amsterdam 1984Google Scholar
- [Vilain/Kautz86]M. Vilain, H. Kautz: Constraint Propagation Algorithms for Temporal Reasoning, Proc. AAAI-86.Google Scholar
- [Voß87]H. Voß: Representing and Analyzing Causal, Temporal, and Hierarchical Relations of Devices, Universität Kaiserslautern, SEKI-Report SR-87-17.Google Scholar