TemporalRelation

Fully qualified enumeration name: DDICDIModels::DDICDILibrary::DataTypes::Enumerations::TemporalRelation

Definition

Set of thirteen Allen’s interval relations defined as Contains, Finishes, Meets, Overlaps, Precedes, Starts (and their converses), plus Equals. These are jointly exhaustive and pairwise disjoint binary relations representing temporal relationships between pairs of time intervals.

Explanatory notes

Here are the relations in Allen’s interval algebra:

  • a precedes b (p) and b is preceded by a (P)

  • a meets b (m) and b is met by a (M)

  • a overlaps b (o) and b is overlapped by a (O)

  • a is finished by b (F) and b finishes a (f)

  • a contains B (D) and b is during a (d)

  • a starts b (s) and b is started by a (S)

  • a and b equal (e) each other

Diagram

Enumeration literals

Name

Description

Contains

A contains interval relation. Representation of the contains relation in Allen’s interval algebra. We say that an interval A contains another interval B if and only if A begins before B but finishes after it. More precisely, A.start < B.start < B.end < A.end. Instead of saying that A contains B we can also say that B is during A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.

Equals

An equals interval relation. Representation of the equals relation in Allen’s interval algebra. We say that an interval A equals another interval B if and only if they both begin and finish at the same time. More precisely, A.start = B.start < A.end = B.end. Instead of saying that A equals B we can also say the B equals A (reflexive). An equivalence symmetric relationship: reflexive, symmetric, transitive.

Finishes

A finishes interval relation. Representation of the finishes relation in Allen’s interval algebra. We say that an interval A finishes another interval B if and only if A begins after B but both finish at the same time. More precisely, B.start < A.start < B.end = A.end. Instead of saying that A finishes B we can also say that B is finished by A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.

Meets

A meets interval relation. Representation of the meets relation in Allen’s interval algebra. We say that an interval A meets another interval B if and only if A finishes when B begins. More precisely, A.ends = B.start. Instead of saying that A meets B we can also say that B is met by A (converse). An immediate-precedence relationship: anti-reflexive, anti-symmetric, anti-transitive.

Overlaps

A overlaps interval relation. Representation of the overlaps relation in Allen’s interval algebra. We say that an interval A overlaps another interval B if and only if A begins before B but finishes during B. More precisely, A.start < B.start < A.end < B.end. Instead of saying that A overlaps B we can also say that B is overlapped by A (converse). An acyclic precedence relationship: anti-reflexive, anti-symmetric, neither.

Precedes

A precedes interval relation. Representation of the precedes relation in Allen’s interval algebra. We say that an interval A precedes another interval B if and only if A finishes before B begins. More precisely, A.end < B.start. Instead of saying that A precedes B we can also say that B is preceded by A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.

Starts

A starts interval relation. Representation of the starts relation in Allen’s interval algebra. We say that an interval A starts another interval B if and only if they both start at the same time but A finishes first. More precisely, A.start = B.start < A.end. An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.
Usage

Type

Package

Classifier

Attribute

Class

Process

AllenIntervalAlgebra

temporalIntervalRelation
Syntax representations / encodings

All syntax representations except the Canonical XMI are provided as reference points for specific implementations, or for use as defaults if sufficient in the form presented.

Fragment for the enumeration TemporalRelation

  1<packagedElement xmlns:StandardProfile="http://www.eclipse.org/uml2/5.0.0/UML/Profile/Standard"
  2                 xmlns:uml="http://www.eclipse.org/uml2/5.0.0/UML"
  3                 xmlns:xmi="http://www.omg.org/spec/XMI/20131001"
  4                 xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation"
  5                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#TemporalRelation"
  6                 xmi:type="uml:Enumeration">
  7   <ownedComment xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-ownedComment"
  8                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#TemporalRelation-ownedComment"
  9                 xmi:type="uml:Comment">
 10      <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation"/>
 11      <body>Definition
 12==========
 13Set of thirteen Allen's interval relations defined as Contains, Finishes, Meets, Overlaps, Precedes, Starts (and their converses), plus Equals. These are jointly exhaustive and pairwise disjoint binary relations representing temporal relationships between pairs of time intervals.
 14
 15Explanatory notes
 16=================
 17Here are the relations in Allen's interval algebra:
 18
 19- a precedes b (p) and b is preceded by a (P)
 20- a meets b (m) and b is met by a (M)
 21- a overlaps b (o) and b is overlapped by a (O)
 22- a is finished by b (F) and b finishes a (f)
 23- a contains B (D) and b is during a (d)
 24- a starts b (s) and b is started by a (S)
 25- a and b equal (e) each other</body>
 26   </ownedComment>
 27   <name>TemporalRelation</name>
 28   <ownedLiteral xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Contains"
 29                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Contains"
 30                 xmi:type="uml:EnumerationLiteral">
 31      <ownedComment xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Contains-ownedComment"
 32                    xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Contains-ownedComment"
 33                    xmi:type="uml:Comment">
 34         <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Contains"/>
 35         <body>A contains interval relation. Representation of the contains relation in Allen's interval algebra. We say that an interval A contains another interval B if and only if A begins before B but finishes after it. More precisely, A.start &lt; B.start &lt; B.end &lt; A.end. Instead of saying that A contains B we can also say that B is during A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.</body>
 36      </ownedComment>
 37      <name>Contains</name>
 38   </ownedLiteral>
 39   <ownedLiteral xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Equals"
 40                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Equals"
 41                 xmi:type="uml:EnumerationLiteral">
 42      <ownedComment xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Equals-ownedComment"
 43                    xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Equals-ownedComment"
 44                    xmi:type="uml:Comment">
 45         <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Equals"/>
 46         <body>An equals interval relation. Representation of the equals relation in Allen's interval algebra. We say that an interval A equals another interval B if and only if they both begin and finish at the same time. More precisely, A.start = B.start &lt; A.end = B.end. Instead of saying that A equals B we can also say the B equals A (reflexive). An equivalence symmetric relationship: reflexive, symmetric, transitive.</body>
 47      </ownedComment>
 48      <name>Equals</name>
 49   </ownedLiteral>
 50   <ownedLiteral xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Finishes"
 51                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Finishes"
 52                 xmi:type="uml:EnumerationLiteral">
 53      <ownedComment xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Finishes-ownedComment"
 54                    xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Finishes-ownedComment"
 55                    xmi:type="uml:Comment">
 56         <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Finishes"/>
 57         <body>A finishes interval relation. Representation of the finishes relation in Allen's interval algebra. We say that an interval A finishes another interval B if and only if A begins after B but both finish at the same time. More precisely, B.start &lt; A.start &lt; B.end = A.end. Instead of saying that A finishes B we can also say that B is finished by A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.</body>
 58      </ownedComment>
 59      <name>Finishes</name>
 60   </ownedLiteral>
 61   <ownedLiteral xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Meets"
 62                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Meets"
 63                 xmi:type="uml:EnumerationLiteral">
 64      <ownedComment xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Meets-ownedComment"
 65                    xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Meets-ownedComment"
 66                    xmi:type="uml:Comment">
 67         <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Meets"/>
 68         <body>A meets interval relation. Representation of the meets relation in Allen's interval algebra. We say that an interval A meets another interval B if and only if A finishes when B begins. More precisely, A.ends = B.start. Instead of saying that A meets B we can also say that B is met by A (converse). An immediate-precedence relationship: anti-reflexive, anti-symmetric, anti-transitive.</body>
 69      </ownedComment>
 70      <name>Meets</name>
 71   </ownedLiteral>
 72   <ownedLiteral xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Overlaps"
 73                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Overlaps"
 74                 xmi:type="uml:EnumerationLiteral">
 75      <ownedComment xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Overlaps-ownedComment"
 76                    xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Overlaps-ownedComment"
 77                    xmi:type="uml:Comment">
 78         <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Overlaps"/>
 79         <body>A overlaps interval relation. Representation of the overlaps relation in Allen's interval algebra. We say that an interval A overlaps another interval B if and only if A begins before B but finishes during B. More precisely, A.start &lt; B.start &lt; A.end &lt; B.end. Instead of saying that A overlaps B we can also say that B is overlapped by A (converse). An acyclic precedence relationship: anti-reflexive, anti-symmetric, neither.</body>
 80      </ownedComment>
 81      <name>Overlaps</name>
 82   </ownedLiteral>
 83   <ownedLiteral xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Precedes"
 84                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Precedes"
 85                 xmi:type="uml:EnumerationLiteral">
 86      <ownedComment xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Precedes-ownedComment"
 87                    xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Precedes-ownedComment"
 88                    xmi:type="uml:Comment">
 89         <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Precedes"/>
 90         <body>A precedes interval relation. Representation of the precedes relation in Allen's interval algebra. We say that an interval A precedes another interval B if and only if A finishes before B begins. More precisely, A.end &lt; B.start. Instead of saying that A precedes B we can also say that B is preceded by A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.</body>
 91      </ownedComment>
 92      <name>Precedes</name>
 93   </ownedLiteral>
 94   <ownedLiteral xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Starts"
 95                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Starts"
 96                 xmi:type="uml:EnumerationLiteral">
 97      <ownedComment xmi:id="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Starts-ownedComment"
 98                    xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#Starts-ownedComment"
 99                    xmi:type="uml:Comment">
100         <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-DataTypes-Enumerations-TemporalRelation-Starts"/>
101         <body>A starts interval relation. Representation of the starts relation in Allen's interval algebra. We say that an interval A starts another interval B if and only if they both start at the same time but A finishes first. More precisely, A.start = B.start &lt; A.end. An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.</body>
102      </ownedComment>
103      <name>Starts</name>
104   </ownedLiteral>
105</packagedElement>

Fragment for the enumeration TemporalRelation

 1<xs:simpleType name="TemporalRelationXsdType"
 2               xml:id="TemporalRelationXsdType">
 3  <!-- based on the UML enumeration DDICDIModels::DDICDILibrary::DataTypes::Enumerations::TemporalRelation -->
 4  <xs:annotation>
 5    <xs:documentation>Definition
 6          ==========
 7          Set of thirteen Allen's interval relations defined as Contains, Finishes, Meets, Overlaps, Precedes, Starts (and their converses), plus Equals. These are jointly exhaustive and pairwise disjoint binary relations representing temporal relationships between pairs of time intervals.
 8          
 9          Explanatory notes
10          =================
11          Here are the relations in Allen's interval algebra:
12          
13          - a precedes b (p) and b is preceded by a (P)
14          - a meets b (m) and b is met by a (M)
15          - a overlaps b (o) and b is overlapped by a (O)
16          - a is finished by b (F) and b finishes a (f)
17          - a contains B (D) and b is during a (d)
18          - a starts b (s) and b is started by a (S)
19          - a and b equal (e) each other</xs:documentation>
20  </xs:annotation>
21  <xs:restriction base="xs:NMTOKEN">
22    <xs:enumeration value="Contains">
23      <xs:annotation>
24        <xs:documentation>A contains interval relation. Representation of the contains relation in Allen's interval algebra. We say that an interval A contains another interval B if and only if A begins before B but finishes after it. More precisely, A.start &lt; B.start &lt; B.end &lt; A.end. Instead of saying that A contains B we can also say that B is during A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.</xs:documentation>
25      </xs:annotation>
26    </xs:enumeration>
27    <xs:enumeration value="Equals">
28      <xs:annotation>
29        <xs:documentation>An equals interval relation. Representation of the equals relation in Allen's interval algebra. We say that an interval A equals another interval B if and only if they both begin and finish at the same time. More precisely, A.start = B.start &lt; A.end = B.end. Instead of saying that A equals B we can also say the B equals A (reflexive). An equivalence symmetric relationship: reflexive, symmetric, transitive.</xs:documentation>
30      </xs:annotation>
31    </xs:enumeration>
32    <xs:enumeration value="Finishes">
33      <xs:annotation>
34        <xs:documentation>A finishes interval relation. Representation of the finishes relation in Allen's interval algebra. We say that an interval A finishes another interval B if and only if A begins after B but both finish at the same time. More precisely, B.start &lt; A.start &lt; B.end = A.end. Instead of saying that A finishes B we can also say that B is finished by A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.</xs:documentation>
35      </xs:annotation>
36    </xs:enumeration>
37    <xs:enumeration value="Meets">
38      <xs:annotation>
39        <xs:documentation>A meets interval relation. Representation of the meets relation in Allen's interval algebra. We say that an interval A meets another interval B if and only if A finishes when B begins. More precisely, A.ends = B.start. Instead of saying that A meets B we can also say that B is met by A (converse). An immediate-precedence relationship: anti-reflexive, anti-symmetric, anti-transitive.</xs:documentation>
40      </xs:annotation>
41    </xs:enumeration>
42    <xs:enumeration value="Overlaps">
43      <xs:annotation>
44        <xs:documentation>A overlaps interval relation. Representation of the overlaps relation in Allen's interval algebra. We say that an interval A overlaps another interval B if and only if A begins before B but finishes during B. More precisely, A.start &lt; B.start &lt; A.end &lt; B.end. Instead of saying that A overlaps B we can also say that B is overlapped by A (converse). An acyclic precedence relationship: anti-reflexive, anti-symmetric, neither.</xs:documentation>
45      </xs:annotation>
46    </xs:enumeration>
47    <xs:enumeration value="Precedes">
48      <xs:annotation>
49        <xs:documentation>A precedes interval relation. Representation of the precedes relation in Allen's interval algebra. We say that an interval A precedes another interval B if and only if A finishes before B begins. More precisely, A.end &lt; B.start. Instead of saying that A precedes B we can also say that B is preceded by A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.</xs:documentation>
50      </xs:annotation>
51    </xs:enumeration>
52    <xs:enumeration value="Starts">
53      <xs:annotation>
54        <xs:documentation>A starts interval relation. Representation of the starts relation in Allen's interval algebra. We say that an interval A starts another interval B if and only if they both start at the same time but A finishes first. More precisely, A.start = B.start &lt; A.end. An asymmetric relationship: anti-reflexive, anti-symmetric, transitive.</xs:documentation>
55      </xs:annotation>
56    </xs:enumeration>
57  </xs:restriction>
58</xs:simpleType>

Fragment for the enumeration TemporalRelation (main ontology, entire ontology as zip)

 1# enumeration TemporalRelation
 2# based on the UML enumeration DDICDIModels::DDICDILibrary::DataTypes::Enumerations::TemporalRelation
 3cdi:TemporalRelation
 4  a rdfs:Class, owl:Class, ucmis:Enumeration;
 5  rdfs:label "TemporalRelation";
 6  rdfs:comment "Definition\n==========\nSet of thirteen Allen's interval relations defined as Contains, Finishes, Meets, Overlaps, Precedes, Starts (and their converses), plus Equals. These are jointly exhaustive and pairwise disjoint binary relations representing temporal relationships between pairs of time intervals.\n\nExplanatory notes\n=================\nHere are the relations in Allen's interval algebra:\n\n- a precedes b (p) and b is preceded by a (P)\n- a meets b (m) and b is met by a (M)\n- a overlaps b (o) and b is overlapped by a (O)\n- a is finished by b (F) and b finishes a (f)\n- a contains B (D) and b is during a (d)\n- a starts b (s) and b is started by a (S)\n- a and b equal (e) each other"@en;
 7  
 8.
 9
10cdi:Contains
11  a cdi:TemporalRelation;
12  rdfs:label "Contains";
13  rdfs:comment "A contains interval relation. Representation of the contains relation in Allen's interval algebra. We say that an interval A contains another interval B if and only if A begins before B but finishes after it. More precisely, A.start < B.start < B.end < A.end. Instead of saying that A contains B we can also say that B is during A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive."@en;
14.
15
16cdi:Equals
17  a cdi:TemporalRelation;
18  rdfs:label "Equals";
19  rdfs:comment "An equals interval relation. Representation of the equals relation in Allen's interval algebra. We say that an interval A equals another interval B if and only if they both begin and finish at the same time. More precisely, A.start = B.start < A.end = B.end. Instead of saying that A equals B we can also say the B equals A (reflexive). An equivalence symmetric relationship: reflexive, symmetric, transitive."@en;
20.
21
22cdi:Finishes
23  a cdi:TemporalRelation;
24  rdfs:label "Finishes";
25  rdfs:comment "A finishes interval relation. Representation of the finishes relation in Allen's interval algebra. We say that an interval A finishes another interval B if and only if A begins after B but both finish at the same time. More precisely, B.start < A.start < B.end = A.end. Instead of saying that A finishes B we can also say that B is finished by A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive."@en;
26.
27
28cdi:Meets
29  a cdi:TemporalRelation;
30  rdfs:label "Meets";
31  rdfs:comment "A meets interval relation. Representation of the meets relation in Allen's interval algebra. We say that an interval A meets another interval B if and only if A finishes when B begins. More precisely, A.ends = B.start. Instead of saying that A meets B we can also say that B is met by A (converse). An immediate-precedence relationship: anti-reflexive, anti-symmetric, anti-transitive."@en;
32.
33
34cdi:Overlaps
35  a cdi:TemporalRelation;
36  rdfs:label "Overlaps";
37  rdfs:comment "A overlaps interval relation. Representation of the overlaps relation in Allen's interval algebra. We say that an interval A overlaps another interval B if and only if A begins before B but finishes during B. More precisely, A.start < B.start < A.end < B.end. Instead of saying that A overlaps B we can also say that B is overlapped by A (converse). An acyclic precedence relationship: anti-reflexive, anti-symmetric, neither."@en;
38.
39
40cdi:Precedes
41  a cdi:TemporalRelation;
42  rdfs:label "Precedes";
43  rdfs:comment "A precedes interval relation. Representation of the precedes relation in Allen's interval algebra. We say that an interval A precedes another interval B if and only if A finishes before B begins. More precisely, A.end < B.start. Instead of saying that A precedes B we can also say that B is preceded by A (converse). An asymmetric relationship: anti-reflexive, anti-symmetric, transitive."@en;
44.
45
46cdi:Starts
47  a cdi:TemporalRelation;
48  rdfs:label "Starts";
49  rdfs:comment "A starts interval relation. Representation of the starts relation in Allen's interval algebra. We say that an interval A starts another interval B if and only if they both start at the same time but A finishes first. More precisely, A.start = B.start < A.end. An asymmetric relationship: anti-reflexive, anti-symmetric, transitive."@en;
50.