<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">How to Handle Incomplete Knowledge Concerning Moving Objects</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Nico</forename><surname>Van De Weghe</surname></persName>
							<email>nico.vandeweghe@ugent.be</email>
							<affiliation key="aff0">
								<orgName type="department">Department of Geography</orgName>
								<orgName type="institution">Ghent University</orgName>
								<address>
									<addrLine>Krijgslaan 281 (S8)</addrLine>
									<postCode>B-9000</postCode>
									<settlement>Ghent</settlement>
									<country key="BE">Belgium</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Peter</forename><surname>Bogaert</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Geography</orgName>
								<orgName type="institution">Ghent University</orgName>
								<address>
									<addrLine>Krijgslaan 281 (S8)</addrLine>
									<postCode>B-9000</postCode>
									<settlement>Ghent</settlement>
									<country key="BE">Belgium</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Anthony</forename><forename type="middle">G</forename><surname>Cohn</surname></persName>
							<affiliation key="aff1">
								<orgName type="department">School of Computing</orgName>
								<orgName type="institution">University of Leeds</orgName>
								<address>
									<postCode>LS2 9JT</postCode>
									<settlement>Leeds</settlement>
									<country key="GB">United Kingdom</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Matthias</forename><surname>Delafontaine</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Geography</orgName>
								<orgName type="institution">Ghent University</orgName>
								<address>
									<addrLine>Krijgslaan 281 (S8)</addrLine>
									<postCode>B-9000</postCode>
									<settlement>Ghent</settlement>
									<country key="BE">Belgium</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Leen</forename><surname>De Temmerman</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Geography</orgName>
								<orgName type="institution">Ghent University</orgName>
								<address>
									<addrLine>Krijgslaan 281 (S8)</addrLine>
									<postCode>B-9000</postCode>
									<settlement>Ghent</settlement>
									<country key="BE">Belgium</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Tijs</forename><surname>Neutens</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Geography</orgName>
								<orgName type="institution">Ghent University</orgName>
								<address>
									<addrLine>Krijgslaan 281 (S8)</addrLine>
									<postCode>B-9000</postCode>
									<settlement>Ghent</settlement>
									<country key="BE">Belgium</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Philippe</forename><surname>De Maeyer</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Geography</orgName>
								<orgName type="institution">Ghent University</orgName>
								<address>
									<addrLine>Krijgslaan 281 (S8)</addrLine>
									<postCode>B-9000</postCode>
									<settlement>Ghent</settlement>
									<country key="BE">Belgium</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Frank</forename><surname>Witlox</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Geography</orgName>
								<orgName type="institution">Ghent University</orgName>
								<address>
									<addrLine>Krijgslaan 281 (S8)</addrLine>
									<postCode>B-9000</postCode>
									<settlement>Ghent</settlement>
									<country key="BE">Belgium</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">How to Handle Incomplete Knowledge Concerning Moving Objects</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">8E8954D98DAE78D41309188309274CEE</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-25T05:02+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><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 (QTC B ), which is a calculus for handling interactions between moving point objects (MPO's). Without elaborating on the domain of linguistics, we show that QTC B B B is well-fitted to represent spatiotemporal natural language. Illustrative examples on how to deal with incomplete knowledge are presented.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>In the last two decades, qualitative formalisms suited to express qualitative temporal (e.g. <ref type="bibr" target="#b5">: Freksa, C., 1992a)</ref> and spatial relationships (e.g. <ref type="bibr" target="#b10">: Randell, D., Cui, Z., and Cohn, A.G., 1992)</ref> between entities have gained wide acceptance as a useful way of abstracting from the real world. Only in recent years, attention has been extended to applications that involve spatio-temporal data. Nevertheless, a variety of research communities have been studying movements of objects, e.g.: <ref type="bibr" target="#b17">Wolfson, O., Xu, B., Chamberlain, S., and Jiang, L., 1998;</ref><ref type="bibr" target="#b3">Erwig, M., Güting, R.H., Schneider, M., and Vazirgiannis, M., 1999;</ref><ref type="bibr" target="#b3">Fernyhough, J.H., Cohn, A.G., and Hogg, D.C., 2000;</ref><ref type="bibr" target="#b8">Nabil, M., Ngu A., and Shepherd A.J., 2001;</ref><ref type="bibr" target="#b9">Pfoser, D., 2002</ref>. Until now, the spatiotemporal community has paid little attention to the qualitative aspects.</p><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 <ref type="bibr" target="#b10">(Randell, D., Cui, Z., and Cohn, A.G., 1992)</ref>. 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 <ref type="bibr" target="#b13">Van de Weghe, N., 2004)</ref>. 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 (QTC B ) (</p><p>) or QTC-Double Cross (QTC B Van de Weghe, N., <ref type="bibr" target="#b12">Cohn, A.G., De Tré, B., and De Maeyer, Ph., 2006</ref> C ) ( ). The reasoning power of QTC has been worked out, applying important reasoning techniques, such as conceptual neighbourhood diagrams (</p><p>) and composition tables ( ). In this paper, the focus is on the feasibility of QTC Van de Weghe, N., <ref type="bibr" target="#b14">Cohn, A.G., De Maeyer, Ph., and Witlox, F., 2005</ref> Van de Weghe, <ref type="bibr">N. and De Maeyer, Ph., 2005</ref> Van de Weghe, N., <ref type="bibr" target="#b15">Kuijpers, B., Bogaert, P., and De Maeyer, Ph., 2005</ref> B B to handle incomplete knowledge<ref type="foot" target="#foot_0">1</ref> . Without elaborating on the domain of linguistics, we show that QTC B is well-fitted to represent spatio-temporal natural language.</p><p>B After an explanation of incomplete knowledge and how it is related to qualitative reasoning, a brief overview of QTC B is presented. Section 4 presents illustrative examples on how to handle incomplete knowledge within the different types of QTC B B B . Section 5 concludes the paper and gives some directions for further research.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Qualitative Reasoning and Incomplete Knowledge</head><p>Reasoning can be performed on quantitative as well as on qualitative information. According to Goyal <ref type="bibr" target="#b7">(Goyal, R.K., 2000)</ref>, 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 <ref type="bibr" target="#b16">(Weld, D.S. and de Kleer, J., 1990)</ref>. The major idea in the qualitative approach is that only relevant distinctions are made <ref type="bibr" target="#b0">(Clementini, E., Di Felice, P., and D. Hernandez, 1997)</ref>. 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 + <ref type="bibr" target="#b1">(Cohn, A.G. and Hazarika, S.M., 2001)</ref>.</p><p>Not always everything has to be known about a situation to make inferences which are important for the specific study <ref type="bibr" target="#b4">(Frank, A.U., 1996)</ref>. Obviously in such situations sometimes information lacks for giving complete answers to queries. However, like Freksa <ref type="bibr">(Freksa, C., 1992a, p.203)</ref> 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 <ref type="bibr" target="#b2">(Cristani, M., Cohn, A.G., and Bennett, B., 2000)</ref>.</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 <ref type="bibr">(Freksa, C., 1992)</ref> and the spatial Double-Cross Calculus <ref type="bibr" target="#b6">(Freksa, C., 1992b;</ref><ref type="bibr" target="#b18">Zimmermann, K. and Freksa, C., 1996)</ref>. 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">The Qualitative Trajectory Calculus -Basic (QTC B ) B</head><p>In this section, an informal account of the Qualitative Trajectory Calculus -Basic (QTC B ) is presented. For a formal axiomatisation, we refer to (</p><p>). Continuous time for QTC B Van de Weghe, N., 2004 B B is assumed. In general, QTC B 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 . QTC</p><formula xml:id="formula_0">B − + − +</formula><p>B1D 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 QTC B1D :</p><p>x|t denotes the position of an object x at time t, d <ref type="bibr">(u,v)</ref> denotes the distance between two positions u and v, v x |t denotes the speed of x at time t, t 1 &lt; t 2 denotes that t 1 is temporally before t 2 .</p><p>A movement is presented in QTC B1D using the following four conditions (C):</p><p>C1. Movement of k with respect to the position of l at t (distance constraint):</p><formula xml:id="formula_1">−: k is moving towards l: ∃t 1 (t 1 &lt; t ∧ ∀ t − (t 1 &lt; t − &lt; t → d(k|t − , l|t) &gt; d(k|t, l|t))) ∧ ∃t 2 (t &lt; t 2 ∧ ∀ t + (t &lt; t + &lt; t 2 → d(k|t, l|t) &gt; d(k|t + , l|t))) +: k is moving away from l: ∃t 1 (t 1 &lt; t ∧ ∀ t − (t 1 &lt; t − &lt; t → d(k|t − , l|t) &lt; d(k|t, l|t))) ∧ ∃t 2 (t &lt; t 2 ∧ ∀ t + (t &lt; t + &lt; t 2 → d(k|t, l|t) &lt; d(k|t + , l|t))) 0: k is stable with respect to l (all other cases):</formula><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.</p><p>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):</p><formula xml:id="formula_2">−: v k |t &lt; v l |t +: v k |t &gt; v l |t 0: v k |t = v l |t</formula><p>Accordingly, a qualitative trajectory pair can be represented by a label consisting of two or three characters, for respectively QTC BL1 (QTC B of level one) only handling the changing distance between two objects and QTC B BL2 (QTC B B 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. <ref type="figure" target="#fig_0">1A</ref>, 10 relations are impossible (e.g. relation 2b: if object k moves towards object l and object l stands still, then v k &lt; v l is impossible). Therefore, we get only 17 B12-relations. Each icon in Fig. <ref type="figure" target="#fig_0">1A</ref> 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 QTC B2D . The definitions for the 2D movement are the same as the definitions for the 1D movement. In contrast with QTC B12 , there are 27 potential B22-relations, represented as 27 B22-relation icons in Fig. <ref type="figure" target="#fig_0">1B</ref>. 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 QTC B1D, 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. 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).</p><p>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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.1.">From Fine to Incomplete Knowledge</head><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 QTC B11 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, QTC B2D and QTC B1D 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><formula xml:id="formula_3">Ex2 ↔ (-+) B11 and Ex2 ↔ (-+ A 2 ) B12</formula><p>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 QTC B11 . The difference between Ex1 and Ex2 has perhaps more implications for QTC B12 , since (-+ A) B12 consists of a disjunction of solutions:</p><p>The following statement is false:</p><formula xml:id="formula_4">Ex2 → a (with a ∈ (-+ A) B12 )</formula><p>The following statement is true:</p><formula xml:id="formula_5">a → Ex2 (with a ∈ (-+ A) B12 ) Ex2 → (-+) B21 and Ex2 → (-+ A) B22</formula><p>Ex2 represented in QTC B22 gives no extra information compared to Ex2 represented in QTC B21 since the third character of QTC B22 , differentiating QTC B22 from QTC B21 , 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 .</p><p>Ex3: k is moving towards l, which in turn is moving away from k.</p><p>Ex3 ↔ (-+) B11 and Ex3 ↔ (-+ A) B12</p><p>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</p><p>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. <ref type="figure" target="#fig_0">1A</ref> with those for (-+ A) B22 in Fig. <ref type="figure" target="#fig_0">1B</ref>.</p><p>Ex4a: k is moving towards l.</p><p>Ex4a ↔ (-A) B11 and Ex4a ↔ (-A B) B12</p><p>This expression does not state whether l is moving. Because this expression is less complete than Ex3, it is obvious that we cannot distinguish QTC B11 from QTC B12 . However, note in QTC B12 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) B21 and Ex4a ↔ (-A B) B22</p><p>As could be expected, there is no difference between for QTC B11 and QTC B21 .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.2.">From Incomplete to Fine Knowledge</head><p>Now, let us start from four expressions (Ex4a, Ex4b, Ex4c, and Ex4d), which together form the fine compound expression Ex1:</p><formula xml:id="formula_6">Ex4a: k is moving towards l. Ex4a ↔ (-A) B11 Ex4a ↔ (-A B) B12 Ex4a ↔ (-A) B21 Ex4a ↔ (-A B) B22</formula><p>Ex4b: l is moving away from k.</p><formula xml:id="formula_7">Ex4b ↔ (A +) B11 Ex4b ↔ (A + B) B12 Ex4b ↔ (A +) B21 Ex4b ↔ (A + B) B22</formula><p>Again, there is no difference between the representations of QTC B11 and QTC B21 , and those of QTC B12 and QTC B22 .</p><p>Ex4c: k and l are moving along the same straight line.</p><formula xml:id="formula_8">Ex4c ↔ (A* 3 B*) B11 Ex4c ↔ (A* B* C) B12 Ex4c → (A* B*) B21 Ex4c → (A* B* C) B22</formula><p>Because it is specified that both objects are moving, neither of the two objects may stand still.</p><p>Ex4d: k and l have the same speed.</p><p>Ex4d → (A* B*, 0 0) B11 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><formula xml:id="formula_9">Ex4d → (A B) B21 and Ex4d ↔ (A B 0) B22</formula><p>In contrast to QTC B11 , every relation is possible in QTC B21 , which is a direct result of specifications concerning the exclusive B22-relations.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.3.">Overall Result</head><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.</p><p>(</p><formula xml:id="formula_10">A) B11 ∩ (A +) B11 ∩ (A* B*) B11 ∩ (A* B*, 0 0) B11 = (-+) B11 (-A B) B12 ∩ (A + B) B12 ∩ (A* B* C) B21 ∩ (A* B* 0, 0 0 0) B12 = (-+ 0) B12<label>-</label></formula><p>The intersection of the four solution sets for QTC B2D of each expression is respectively (-+) B21 and (-+ 0) B22 . Again (cf. QTC B1D ), 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>(</p><formula xml:id="formula_11">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<label>-</label></formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">How Many Objects Are Moving?</head><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 QTC B . B</p><p>Ex5: At least one of the objects is moving.</p><formula xml:id="formula_12">Ex5 ↔ (A B) \ (0 0) B11 Ex5 ↔ (A B C) \ (0 0 0) B12 Ex5 → (A B) B21 Ex5 → (A B C) B22</formula><p>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 QTC B21 and QTC B22 , 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: Exactly one of the objects is moving.</p><p>Ex6 ↔ (A* 0,0 B*) B11 Ex6 ↔ (A* 0 B, 0 A* B) B12 Ex6 → (A 0, 0 A) B21 Ex6 → (A 0 B, 0 A B) B22</p><p>Note again the subtle difference between QTC B1D and QTC B2D . In QTC B1D , an object can only move when a character is different from 0. In QTC B2D , an object can move if a character is 0. Note that (A*B*) B21 is impossible since here both objects are moving.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion</head><p>Based on several illustrative examples, the ability of handling incomplete knowledge and natural language expressions within QTC B is studied. In further research, the possibilities of QTC-Double Cross (QTC B C ) to handle incomplete knowledge will be discussed. Since QTC C 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 QTC C2D, it is not possible in QTC B2D 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></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Fig. 1 :</head><label>1</label><figDesc>Fig. 1: (A) B12-relation icons, (B) B22-relation icons 4 Incomplete Knowledge about Moving Objects Handled NaturallyIn 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 QTC B 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 QTC B</figDesc><graphic coords="5,124.76,327.06,349.34,179.71" type="bitmap" /></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">Knowledge only containing one relation in a specific calculus is called complete or fine knowledge. A union of fine relations results in incomplete knowledge.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">A qualitative variable A (B, C, …) stands for the set {-, 0, +}</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">A qualitative variable A* (B*, C*, ...) stands for the set {−, +}</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Qualitative representation of positional information</title>
		<author>
			<persName><forename type="first">E</forename><surname>Clementini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Di Felice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Hernandez</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">AI</title>
		<imprint>
			<biblScope unit="volume">95</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="317" to="356" />
			<date type="published" when="1997">1997</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Qualitative spatial representation and reasoning: an overview</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Cohn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Hazarika</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Fundamenta Informaticae</title>
		<imprint>
			<biblScope unit="volume">46</biblScope>
			<biblScope unit="issue">1-2</biblScope>
			<biblScope unit="page" from="1" to="29" />
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Spatial locations via morpho-mereology</title>
		<author>
			<persName><forename type="first">M</forename><surname>Cristani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Cohn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Bennett</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Conf. on Principles of Knowledge Representation and Reasoning</title>
				<imprint>
			<date type="published" when="2000">2000</date>
			<biblScope unit="page" from="15" to="25" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Constructing qualitative event models automatically from video input</title>
		<author>
			<persName><forename type="first">M</forename><surname>Erwig</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">H</forename><surname>Güting</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Schneider</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Vazirgiannis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Fernyhough</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Cohn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">C</forename><surname>Hogg</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Spatio-temporal data types: an approach to modelling objects in databases</title>
				<imprint>
			<date type="published" when="1999">1999. 2000</date>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="81" to="103" />
		</imprint>
	</monogr>
	<note>Geoinformatica</note>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Qualitative spatial reasoning: cardinal directions as an example</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">U</forename><surname>Frank</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Geographical Information Science</title>
		<imprint>
			<biblScope unit="volume">10</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="269" to="290" />
			<date type="published" when="1996">1996</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Temporal reasoning based on semi-intervals</title>
		<author>
			<persName><forename type="first">C</forename><surname>Freksa</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">AI</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<biblScope unit="page" from="199" to="227" />
			<date type="published" when="1992">1992a</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Using orientation information for qualitative spatial reasoning</title>
		<author>
			<persName><forename type="first">C</forename><surname>Freksa</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Int. Conf. on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space</title>
				<imprint>
			<date type="published" when="1992">1992b</date>
			<biblScope unit="volume">639</biblScope>
			<biblScope unit="page" from="162" to="178" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<title level="m" type="main">Similarity Assessment for Cardinal Directions between Extended Spatial Objects</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">K</forename><surname>Goyal</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2000">2000</date>
			<biblScope unit="page">167</biblScope>
		</imprint>
		<respStmt>
			<orgName>USA, University of Maine</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">PhD thesis</note>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Modelling and retrieval of moving objects</title>
		<author>
			<persName><forename type="first">M</forename><surname>Nabil</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ngu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">J</forename><surname>Shepherd</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Multimedia Tools and Applications</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="35" to="71" />
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Indexing the trajectories of moving objects</title>
		<author>
			<persName><forename type="first">D</forename><surname>Pfoser</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Data Engineering Bulletin</title>
		<imprint>
			<biblScope unit="volume">25</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="3" to="9" />
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">A spatial logic based on regions and connection</title>
		<author>
			<persName><forename type="first">D</forename><surname>Randell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Cui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Cohn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Conf. on Knowledge Representation and Reasoning</title>
				<imprint>
			<date type="published" when="1992">1992</date>
			<biblScope unit="page" from="165" to="176" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Conceptual neighbourhood diagrams for representing moving objects</title>
		<author>
			<persName><forename type="first">N</forename><surname>Van De Weghe</surname></persName>
		</author>
		<author>
			<persName><surname>De Maeyer</surname></persName>
		</author>
		<author>
			<persName><surname>Ph</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Int. Workshop on Conceptual Modeling for Geographic Information System</title>
				<imprint>
			<date type="published" when="2005">2005. 3770</date>
			<biblScope unit="page" from="228" to="238" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">A qualitative trajectory calculus as a basis for representing moving objects in geographical information systems</title>
		<author>
			<persName><forename type="first">N</forename><surname>Van De Weghe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Cohn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>De Tré</surname></persName>
		</author>
		<author>
			<persName><surname>De Maeyer</surname></persName>
		</author>
		<author>
			<persName><surname>Ph</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Control and Cybernetics</title>
				<imprint>
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
	<note>Accepted for publication</note>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">Representing and Reasoning about Moving Objects: A Qualitative Approach</title>
		<author>
			<persName><forename type="first">N</forename><surname>Van De Weghe</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2004">2004</date>
			<biblScope unit="page">268</biblScope>
		</imprint>
		<respStmt>
			<orgName>Belgium, Ghent University</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">PhD thesis</note>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Representing moving objects in computer-based expert systems: the overtake event example</title>
		<author>
			<persName><forename type="first">N</forename><surname>Van De Weghe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Cohn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Ph</forename><surname>De Maeyer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Witlox</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Expert Systems with Applications</title>
		<imprint>
			<biblScope unit="volume">29</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="977" to="983" />
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">A qualitative trajectory calculus and the composition of its relations</title>
		<author>
			<persName><forename type="first">N</forename><surname>Van De Weghe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Kuijpers</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bogaert</surname></persName>
		</author>
		<author>
			<persName><surname>De Maeyer</surname></persName>
		</author>
		<author>
			<persName><surname>Ph</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Int. Conf. on Geospatial Semantics, LNCS</title>
				<imprint>
			<date type="published" when="2005">2005. 3799</date>
			<biblScope unit="page" from="60" to="76" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<monogr>
		<title level="m" type="main">Readings in Qualitative Reasoning about Physical Systems</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">S</forename><surname>Weld</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>De Kleer</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1990">1990</date>
			<publisher>Morgan Kaufmann</publisher>
			<biblScope unit="page">720</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Moving object databases: issues and solutions</title>
		<author>
			<persName><forename type="first">O</forename><surname>Wolfson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chamberlain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Jiang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Int. Conf. on Scientific and Statistical Database Management</title>
				<imprint>
			<date type="published" when="1998">1998</date>
			<biblScope unit="page" from="111" to="122" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Qualitative spatial reasoning using orientation, distance, and path knowledge</title>
		<author>
			<persName><forename type="first">K</forename><surname>Zimmermann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Freksa</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Applied Intelligence</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="49" to="58" />
			<date type="published" when="1996">1996</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
