<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>A* B*</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>How to Handle Incomplete Knowledge Concerning Moving Objects</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nico Van de Weghe</string-name>
          <email>nico.vandeweghe@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Peter Bogaert</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anthony G. Cohn</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matthias Delafontaine</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leen De Temmerman</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tijs Neutens</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Philippe De Maeyer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Frank Witlox</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Geography, Ghent University</institution>
          ,
          <addr-line>Krijgslaan 281 (S8), B-9000 Ghent</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Computing, University of Leeds</institution>
          ,
          <addr-line>Leeds LS2 9JT</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2006</year>
      </pub-date>
      <volume>0</volume>
      <issue>0</issue>
      <fpage>977</fpage>
      <lpage>983</lpage>
      <abstract>
        <p>In this paper, we present a way of how to handle incomplete knowledge concerning moving objects. Our approach is based on the basic Qualitative Trajectory Calculus (QTCBB), which is a calculus for handling interactions between moving point objects (MPO's). Without elaborating on the domain of linguistics, we show that QTCBB is well-fitted to represent spatiotemporal natural language. Illustrative examples on how to deal with incomplete knowledge are presented.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Apart from some limiting cases, such as a car accident and a predator catching a prey,
where moving objects meet, mobile objects are represented by the relation disjoint in
calculi defining topological relations, such as RCC
        <xref ref-type="bibr" rid="ref13">(Randell, D., Cui, Z., and Cohn,
A.G., 1992)</xref>
        . This approach ignores some important aspects of reasoning about
continuously moving physical objects. For example, given two trains on a railroad, it
is of the utmost importance to know their movement with respect to each other, in
order to detect whether or not they could crash in the near future. Thus, the inherent
property with topological theories is that they put all disjoint relations into one
undifferentiated set. Therefore, a challenging question remained largely unaddressed:
‘How do we handle changes in movement between moving objects, if there is no
change in their topological relationship?’ With this in mind, and starting from the idea
that the enormous complexity of interacting real world objects can be described by the
relations between pairs of interacting point objects being constantly disjoint, the
Qualitative Trajectory Calculus (QTC) was introduced by Van de Weghe Van de
Weghe, N., 2004). QTC is a theory for representing and reasoning about movements
of objects in a qualitative framework, able to differentiate between groups of
disconnected objects. Depending on the level of detail and the number of spatial
dimensions, different types of QTC were defined all belonging to QTC-Basic (QTCBB)
(Van de Weghe, N., Cohn, A.G., De Tré, B., and De Maeyer, Ph., 2006) or
QTCDouble Cross (QTCC)
        <xref ref-type="bibr" rid="ref14">(Van de Weghe, N., Cohn, A.G., De Maeyer, Ph., and Witlox,
F., 2005)</xref>
        . The reasoning power of QTC has been worked out, applying important
reasoning techniques, such as conceptual neighbourhood diagrams
        <xref ref-type="bibr" rid="ref14">(Van de Weghe,
N. and De Maeyer, Ph., 2005)</xref>
        and composition tables
        <xref ref-type="bibr" rid="ref14">(Van de Weghe, N., Kuijpers,
B., Bogaert, P., and De Maeyer, Ph., 2005)</xref>
        . In this paper, the focus is on the
feasibility of QTCBB to handle incomplete knowledge1. Without elaborating on the
domain of linguistics, we show that QTCBB is well-fitted to represent spatio-temporal
natural language.
      </p>
      <p>After an explanation of incomplete knowledge and how it is related to qualitative
reasoning, a brief overview of QTCBB is presented. Section 4 presents illustrative
examples on how to handle incomplete knowledge within the different types of
QTCBB. Section 5 concludes the paper and gives some directions for further research.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Qualitative Reasoning and Incomplete Knowledge</title>
      <p>
        Reasoning can be performed on quantitative as well as on qualitative information.
According to Goyal
        <xref ref-type="bibr" rid="ref10">(Goyal, R.K., 2000)</xref>
        , a predefined unit of a quantity is used,
typically when working with quantitative information. In the qualitative approach,
continuous information is discretised by landmarks separating neighbouring open
intervals, resulting in discrete quantity spaces (Weld, D.S. and de Kleer, J., 1990).
The major idea in the qualitative approach is that only relevant distinctions are made
        <xref ref-type="bibr" rid="ref1">(Clementini, E., Di Felice, P., and D. Hernandez, 1997)</xref>
        . Thus, qualitative reasoning
only studies the essence of information, represented as a small set of symbols such as
the quantity space {–, 0, +} consisting of the landmark value 0 and its neighbouring
open intervals ]-∞,0[ and ]0,∞[ represented respectively by the symbol – and +
        <xref ref-type="bibr" rid="ref11 ref2">(Cohn, A.G. and Hazarika, S.M., 2001)</xref>
        .
      </p>
      <p>
        Not always everything has to be known about a situation to make inferences which
are important for the specific study
        <xref ref-type="bibr" rid="ref6">(Frank, A.U., 1996)</xref>
        . Obviously in such situations
sometimes information lacks for giving complete answers to queries. However, like
Freksa
        <xref ref-type="bibr" rid="ref7 ref8">(Freksa, C., 1992a, p.203)</xref>
        states, ‘a partial answer may be better than no
answer at all.’ By abstracting away from metrical details, qualitative representations
are much more appropriate for handling such incomplete knowledge than quantitative
methods
        <xref ref-type="bibr" rid="ref3 ref5">(Cristani, M., Cohn, A.G., and Bennett, B., 2000)</xref>
        .
      </p>
      <p>
        The development of the Qualitative Trajectory Calculus (QTC) has been inspired by
some important qualitative calculi in temporal and spatial reasoning, especially the
temporal Semi-Interval Calculus
        <xref ref-type="bibr" rid="ref7 ref8">(Freksa, C., 1992)</xref>
        and the spatial Double-Cross
1 Knowledge only containing one relation in a specific calculus is called complete or fine
knowledge. A union of fine relations results in incomplete knowledge.
Calculus
        <xref ref-type="bibr" rid="ref7 ref8">(Freksa, C., 1992b; Zimmermann, K. and Freksa, C., 1996)</xref>
        . Central in these
theories is the specific attention to incomplete knowledge, for example produced by
natural language expressions. In combination with the inherent capability of the
qualitative calculi lying at the basis of QTC, one might expect that QTC ought to be
able to handle incomplete knowledge.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. The Qualitative Trajectory Calculus – Basic (QTCBB)</title>
      <p>In this section, an informal account of the Qualitative Trajectory Calculus – Basic
(QTCBB) is presented. For a formal axiomatisation, we refer to (Van de Weghe, N.,
2004). Continuous time for QTCBB is assumed. In general, QTCBB compares positions
of two objects at different moments in time. The movement of the first object (called
k) with respect to the second object (called l) is studied by comparing the distance
between l at the current time point (denoted t) and k during the period immediately
before the current time point (denoted t−), with the distance between l at t and k during
the period immediately after the current time point (denoted t+). In addition, the
movement of l with respect to k is studied by comparing the distance between k at t
and l at t−, with the distance between k at t and l at t+. QTCB1D handles the qualitative
movement of two constantly disjoint point objects restricted to 1D. Because the
movement is restricted to 1D, the velocity vector of an object only has two possible
directions, with the intermediate case where the object stands still. Hence, the
direction of the movement of each object can be described by one single qualitative
variable. Both degrees of freedom can be further subdivided according to the relative
speed of the objects. This subdivision results in redundant information because the
relative speed of k with respect to l is the inverse of the relative speed of l with respect
to k. By reducing the continuum to the qualitative values –, 0 and +, the underlying
continuous system can be described discretely. We introduce the following notation
for QTCB1D:
x|t denotes the position of an object x at time t,
d(u,v) denotes the distance between two positions u and v,
vx|t denotes the speed of x at time t,
t1 &lt; t2 denotes that t1 is temporally before t2.</p>
      <p>A movement is presented in QTCB1D using the following four conditions (C):
C1. Movement of k with respect to the position of l at t (distance constraint):
−: k is moving towards l:
∃t1 (t1 &lt; t ∧ ∀ t − (t1 &lt; t − &lt; t → d(k|t −, l|t) &gt; d(k|t, l|t))) ∧
∃t2 (t &lt; t2 ∧ ∀ t + (t &lt; t + &lt; t2 → d(k|t, l|t) &gt; d(k|t+, l|t)))
+: k is moving away from l:
∃t1 (t1 &lt; t ∧ ∀ t − (t1 &lt; t − &lt; t → d(k|t −, l|t) &lt; d(k|t, l|t))) ∧
∃t2 (t &lt; t2 ∧ ∀ t + (t &lt; t + &lt; t2 → d(k|t, l|t) &lt; d(k|t+, l|t)))
0: k is stable with respect to l (all other cases):</p>
      <p>all other cases
C2. The movement of l with respect to the position of k at t (distance constraint) can
be described as in C1 with k and l interchanged.
C3. Relative speed of k at t with respect to l at t (which dually represents the relative
speed of l at t with respect to k at t) (speed constraint):
−: vk|t &lt; vl|t +: vk|t &gt; vl|t 0: vk|t = vl|t
Accordingly, a qualitative trajectory pair can be represented by a label consisting of
two or three characters, for respectively QTCBL1 (QTCBB of level one) only handling
the changing distance between two objects and QTCBL2 (QTCBB of level two) also
taking into account the third label representing the relative speed of both object with
respect to each other. In theory, there should be 27 (3³) B12-relations (QTC relations
of level two in 1D). As illustrated in Fig. 1A, 10 relations are impossible (e.g. relation
2b: if object k moves towards object l and object l stands still, then vk &lt; vl is
impossible). Therefore, we get only 17 B12-relations. Each icon in Fig. 1A represents
one single relation, and therefore is called a relation icon, in this particular case a
B12-relation icon. The left and the right dot of the B12-relation icon respectively
represent the positions of k and l. The line segments represent whether each object can
be moving towards or away from the other. A dot is filled if the object can be
stationary, and open if an object cannot be stationary. The representations are no more
than icons, in which we assume that k is on the left side of l.</p>
      <p>The approach for 1D can be successfully used for higher dimensions by denoting the
Euclidean distance between a pair of point objects as being the only dimension. This
way 2D and even 3D movements can be reduced to 1D movements. To emphasise
that we are working on 2D movements, the theory is called QTCB2D. The definitions
for the 2D movement are the same as the definitions for the 1D movement. In contrast
with QTCB12, there are 27 potential B22-relations, represented as 27 B22-relation
icons in Fig. 1B. If, for example, the first character of the B22-relation is 0, then the
first object stands still or can move tangentially with the second object. The icons
contain line segments with the point object in the middle of it. The line segment
stands for the opportunity to move to both sides of the point object. A filled dot
represents the case when the object can be stationary. An open dot means that the
object cannot be stationary. The icons also contain crescents with the point object in
the middle of its straight border. If a crescent is used, then the movement starts in the
dot and ends somewhere on the curved side of the crescent. It is important that the
crescent is an open polygon: the straight boundary of a crescent is an element of
another relation. Of major importance is that, in contrast to QTCB1D, all 27 relations
are possible. The reason for this is quite straightforward. In 1D, an object can only
move along a straight line. On the other hand, in 2D an object can move throughout
the complete 2D space, being a higher dimension than the 1D distance. Therefore,
there is a higher degree of freedom in B2D-movements compared to
B1D-movements, resulting in the different number of possible relations.
In common with qualitative spatial and temporal calculi, we need to consider that we
do not always have complete knowledge about which relation holds between a pair of
moving objects. In this section, illustrative examples on how to handle incomplete
knowledge within QTCBB are presented. Expressions in natural language (Ex), about
the movement of two objects (k and l) with respect to each other, are considered. We
determine which QTCBB relations hold for each particular expression. We use the
standard notation for implication and equivalence:
a → b: if a, then b
a ↔ b: if and only if a, then b
as well as the standard notations for the following set operations:
a \ b : a minus b
a ∩ b : intersection of a and b</p>
    </sec>
    <sec id="sec-4">
      <title>4.1. From Fine to Incomplete Knowledge and Vice Versa</title>
      <p>This example starts from Ex1 forming fine knowledge concerning moving objects,
and relaxes the constraints in order to get incomplete knowledge (Ex2, Ex3 and Ex4a).
Thereafter, the inverse approach is discussed. Starting from several incomplete
constraints (Ex4a, Ex4b, Ex4c, and Ex4d), fine knowledge will be generated by the
intersection of the incomplete solutions. The example is worked out for 1D and 2D.</p>
    </sec>
    <sec id="sec-5">
      <title>4.1.1. From Fine to Incomplete Knowledge</title>
      <p>Ex1:
k is moving towards l, which in turn is moving away from k, both objects
moving along the same straight line and having the same speed.</p>
      <p>Ex1 → (– +)B11 and Ex1 ↔ (– + 0)B12
QTCB11 does not give full detail, because (– +)B11 also contains situations where k and
l have a different speed. Therefore, it is more appropriate to work at level two, which
incorporates the speed variable.</p>
      <p>Ex1 → (– +)B21 and Ex1 → (– + 0)B22
At first sight, QTCB2D and QTCB1D give the same result. However, there is only an
implication (→) between Ex1 and (– + 0)B22, because (– + 0)B22 does not consider the
restriction in Ex1 that both objects are moving along the same straight line, which was
an implicit restriction for movements in 1D.</p>
      <p>Ex2:
k is moving towards l, which in turn is moving away from k, both objects
moving along the same straight line.</p>
      <p>Ex2 ↔ (– +)B11 and Ex2 ↔ (– + A2)B12
The only difference between Ex1 and Ex2 is the speed constraint, which is not given
in Ex2. In contradiction to Ex1, we have in Ex2: if (– +)B11 is true, then Ex2 must be
true. Ex2 is thus totally covered by QTCB11. The difference between Ex1 and Ex2 has
perhaps more implications for QTCB12, since (– + A)B12 consists of a disjunction of
solutions:</p>
      <p>The following statement is false: Ex2 → a (with a ∈ (– + A)B12)
The following statement is true: a → Ex2 (with a ∈ (– + A)B12)</p>
      <p>Ex2 → (– +)B21 and Ex2 → (– + A)B22
2 A qualitative variable A (B, C, …) stands for the set {–, 0, +}
Ex2 represented in QTCB22 gives no extra information compared to Ex2 represented in
QTCB21 since the third character of QTCB22, differentiating QTCB22 from QTCB21, can
have all qualitative values. Note that there is only an implication (→) between Ex2
and (– +)B21, because (– +)B21 does not consider the restriction in Ex2 that both objects
are moving along the same straight line, which was an implicit restriction for
movements in 1D. The same applies to the implication between Ex2 and (– + A)B22.
Ex3:
k is moving towards l, which in turn is moving away from k.</p>
      <p>Ex3 ↔ (– +)B11 and Ex3 ↔ (– + A)B12
Compared to Ex2, the objects do not need to move along a straight line. However, this
constraint is straightforward, since we are working in 1D.</p>
      <p>Ex3 ↔ (– +)B21 and Ex3 ↔ (– + A)B22
In contrast to the 1D movement, the constraint that both objects have to move on the
same straight line (or in 1D) is important in 2D. In Ex3, this constraint is deleted,
which results in an important extension of the solution set. This extension can be seen
in the formulae; on the one hand one gets an implication between Ex2 and the B2D
relations, on the other hand one gets an equivalence between Ex3 and the B2D
relations. This extension can be easily seen by comparing the relation icons for (– +
A)B21 in Fig. 1A with those for (– + A)B22 in Fig. 1B.</p>
      <sec id="sec-5-1">
        <title>Ex4a: k is moving towards l.</title>
        <p>Ex4a ↔ (– A)B11 and Ex4a ↔ (– A B)B12
This expression does not state whether l is moving. Because this expression is less
complete than Ex3, it is obvious that we cannot distinguish QTCB11 from QTCB12.
However, note in QTCB12 that when l is not moving, only (– 0 +)B12 holds, because (–
0 –)B12 and (– 0 0)B12 are impossible in 1D.</p>
        <p>Ex4a ↔ (– A)B21and Ex4a ↔ (– A B)B22
As could be expected, there is no difference between for QTCB11 and QTCB21.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>4.1.2. From Incomplete to Fine Knowledge</title>
      <p>Now, let us start from four expressions (Ex4a, Ex4b, Ex4c, and Ex4d), which together
form the fine compound expression Ex1:</p>
      <sec id="sec-6-1">
        <title>Ex4a: k is moving towards l.</title>
        <p>Ex4a ↔ (– A)B11
Ex4a ↔ (– A B)B12
Ex4a ↔ (– A)B21
Ex4b: l is moving away from k.
Ex4b ↔ (A +)B11
Ex4b ↔ (A + B)B12
Ex4b ↔ (A +)B21
Ex4b ↔ (A + B)B22
Ex4c ↔ (A*3 B*)B11
Ex4c ↔ (A* B* C)B12
Ex4c → (A* B*)B21</p>
        <p>Ex4c → (A* B* C)B22
Again, there is no difference between the representations of QTCB11 and QTCB21, and
those of QTCB12 and QTCB22.</p>
      </sec>
      <sec id="sec-6-2">
        <title>Ex4c: k and l are moving along the same straight line. Because it is specified that both objects are moving, neither of the two objects may stand still.</title>
      </sec>
      <sec id="sec-6-3">
        <title>Ex4d: k and l have the same speed.</title>
        <p>Ex4d → (A* B*, 0 0)B11</p>
        <p>Ex4d ↔ (A* B* 0, 0 0 0)B12
It is not specified whether the speed has to be higher than zero. Therefore, (0 0)B11 and
(0 0 0)B12 are possibilities. However, since the speed of both objects has to be the
same, it is impossible to have a pair of objects where only one object is moving.</p>
        <p>Ex4d → (A B)B21 and Ex4d ↔ (A B 0)B22
In contrast to QTCB11, every relation is possible in QTCB21, which is a direct result of
specifications concerning the exclusive B22-relations.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>4.1.3. Overall Result</title>
      <p>The intersection of the four solution sets of the expressions Ex4a, Ex4b, Ex4c, and
Ex4d, gives (– +)B11 and (– + 0)B12. One can state that the intersection of the solution
sets of the components of a compound expression is the same as the solution set of the
compound expression.
3 A qualitative variable A* (B*, C*, ...) stands for the set {−, +}
The intersection of the four solution sets for QTCB2D of each expression is
respectively (– +)B21 and (– + 0)B22. Again (cf. QTCB1D), the intersection of the
solution sets of the components of a compound expression is the same as the solution
set of the compound expression.</p>
      <p>(– A)B21 ∩ (A +)B21 ∩ (A* B*)B21 ∩ (A B)B21 = (– +)B21
(– A B)B22 ∩ (A + B)B22 ∩ (A* B* C)B22 ∩ (A B 0)B22 = (– + 0)B22</p>
    </sec>
    <sec id="sec-8">
      <title>4.2. How Many Objects Are Moving?</title>
      <p>If we say that an object is moving, we can have interpretation problems; do we mean
that at least one of the objects is moving, or do we mean that exactly one object is
moving? This ambiguity can be overcome by QTCBB.</p>
      <p>Ex5:</p>
      <sec id="sec-8-1">
        <title>At least one of the objects is moving.</title>
        <p>Ex5 ↔ (A B) \ (0 0)B11
Ex5 ↔ (A B C) \ (0 0 0)B12
Ex5 → (A B)B21</p>
        <p>Ex5 → (A B C)B22
Due to this expression, it is possible that only one object is moving or it could be that
both objects are moving. Note that for QTCB21 and QTCB22, the relations where the
first and the second character are zero do not need to be excluded since objects can
move tangentially when both the first and the second are 0 in 2D.</p>
        <p>Ex6:</p>
      </sec>
      <sec id="sec-8-2">
        <title>Exactly one of the objects is moving.</title>
        <p>Ex6 ↔ (A* 0,0 B*)B11
Ex6 ↔ (A* 0 B, 0 A* B)B12
Ex6 → (A 0, 0 A)B21</p>
        <p>Ex6 → (A 0 B, 0 A B)B22
Note again the subtle difference between QTCB1D and QTCB2D. In QTCB1D, an object
can only move when a character is different from 0. In QTCB2D, an object can move if
a character is 0. Note that (A*B*)B21 is impossible since here both objects are moving.</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>5. Conclusion</title>
      <p>Based on several illustrative examples, the ability of handling incomplete knowledge
and natural language expressions within QTCBB is studied. In further research, the
possibilities of QTC-Double Cross (QTCC) to handle incomplete knowledge will be
discussed. Since QTCC considers additionally the direction in which an object is
moving with respect to the line segment between the two objects, this calculus is more
expressive and will involve more complex reasoning. Note for example that, in
contrast with QTCC2D, it is not possible in QTCB2D to denote whether two objects are
moving along the same straight line. This will be possible. In the future, we will
continue to explore the bridge between natural language, perception and formal
ontologies of moving objects.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Clementini</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Di</surname>
            <given-names>Felice</given-names>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Hernandez</surname>
          </string-name>
          ,
          <year>1997</year>
          ,
          <article-title>Qualitative representation of positional information</article-title>
          ,
          <source>AI</source>
          ,
          <volume>95</volume>
          (
          <issue>2</issue>
          ),
          <fpage>317</fpage>
          -
          <lpage>356</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Cohn</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hazarika</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <year>2001</year>
          ,
          <article-title>Qualitative spatial representation and reasoning: an overview</article-title>
          ,
          <source>Fundamenta Informaticae</source>
          ,
          <volume>46</volume>
          (
          <issue>1-2</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>29</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Cristani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohn</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Bennett</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <year>2000</year>
          , Spatial locations via morpho-mereology,
          <source>Conf. on Principles of Knowledge Representation and Reasoning</source>
          ,
          <volume>15</volume>
          -
          <fpage>25</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Erwig</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Güting</surname>
            ,
            <given-names>R.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schneider</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Vazirgiannis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <year>1999</year>
          ,
          <article-title>Spatio-temporal data types: an approach to modelling objects in databases</article-title>
          ,
          <source>Geoinformatica</source>
          ,
          <volume>3</volume>
          (
          <issue>3</issue>
          ),
          <fpage>269</fpage>
          -
          <lpage>296</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Fernyhough</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohn</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Hogg</surname>
            ,
            <given-names>D.C.</given-names>
          </string-name>
          ,
          <year>2000</year>
          ,
          <article-title>Constructing qualitative event models automatically from video input</article-title>
          ,
          <source>Image and Vision Computing</source>
          ,
          <volume>18</volume>
          (
          <issue>2</issue>
          ),
          <fpage>81</fpage>
          -
          <lpage>103</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Frank</surname>
            ,
            <given-names>A.U.</given-names>
          </string-name>
          ,
          <year>1996</year>
          ,
          <article-title>Qualitative spatial reasoning: cardinal directions as an example</article-title>
          ,
          <source>International Journal of Geographical Information Science</source>
          ,
          <volume>10</volume>
          (
          <issue>3</issue>
          ),
          <fpage>269</fpage>
          -
          <lpage>290</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Freksa</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , 1992a,
          <article-title>Temporal reasoning based on semi-intervals</article-title>
          ,
          <source>AI</source>
          ,
          <volume>54</volume>
          ,
          <fpage>199</fpage>
          -
          <lpage>227</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Freksa</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , 1992b,
          <article-title>Using orientation information for qualitative spatial reasoning</article-title>
          , Int.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          Conf.
          <article-title>on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space</article-title>
          ,
          <string-name>
            <surname>LNCS</surname>
          </string-name>
          , (
          <volume>639</volume>
          ),
          <fpage>162</fpage>
          -
          <lpage>178</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>R.K.</given-names>
          </string-name>
          ,
          <year>2000</year>
          ,
          <article-title>Similarity Assessment for Cardinal Directions between Extended Spatial Objects</article-title>
          ,
          <source>PhD thesis</source>
          , USA, University of Maine,
          <volume>167</volume>
          pp.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Nabil</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ngu</surname>
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Shepherd</surname>
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <year>2001</year>
          ,
          <article-title>Modelling and retrieval of moving objects</article-title>
          ,
          <source>Multimedia Tools and Applications</source>
          ,
          <volume>13</volume>
          (
          <issue>1</issue>
          ),
          <fpage>35</fpage>
          -
          <lpage>71</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Pfoser</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <year>2002</year>
          ,
          <article-title>Indexing the trajectories of moving objects</article-title>
          ,
          <source>IEEE Data Engineering Bulletin</source>
          ,
          <volume>25</volume>
          (
          <issue>2</issue>
          ),
          <fpage>3</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Randell</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cui</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Cohn</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          ,
          <year>1992</year>
          ,
          <article-title>A spatial logic based on regions and connection</article-title>
          ,
          <source>Conf. on Knowledge Representation and Reasoning</source>
          ,
          <volume>165</volume>
          -
          <fpage>176</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Van de Weghe</surname>
          </string-name>
          , N. and
          <string-name>
            <surname>De Maeyer</surname>
          </string-name>
          , Ph.,
          <year>2005</year>
          ,
          <article-title>Conceptual neighbourhood diagrams for representing moving objects</article-title>
          ,
          <source>Int. Workshop on Conceptual Modeling for Geographic Information System</source>
          ,
          <string-name>
            <surname>LNCS</surname>
          </string-name>
          , (
          <volume>3770</volume>
          ),
          <fpage>228</fpage>
          -
          <lpage>238</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>