<!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 />
    <article-meta>
      <title-group>
        <article-title>Temporal Concept Analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Karl Erich Wolff</string-name>
          <email>wolff@mathematik.tu-darmstadt.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Mathematics, University of Applied Sciences Schoefferstr.</institution>
          <addr-line>3, D-64295 Darmstadt</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>91</fpage>
      <lpage>107</lpage>
      <abstract>
        <p>This paper introduces Temporal Concept Analysis (TCA) as the theory of temporal phenomena described with tools of Formal Concept Analysis (FCA). The basic notion in TCA is that of a Conceptual Time System introduced by the author [42,45] such that state spaces and phase spaces can be defined as concept lattices which clearly represent the meaning of states with respect to the chosen time description. In this paper two closely related types of conceptual time systems are introduced, namely 'conceptual time systems with parts' and 'conceptual time systems with actual objects'. The latter yields a generalization of classical systems with many similar subsystems or particles. Some industrial and scientific applications of conceptual movies of subsystems (particles) are presented.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        For the investigation of temporal phenomena many theories have been developed. A
nice overview over the history of the development of formal representations of 'time'
can be found in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] – ranging from debates about 'time' in ancient Greece over
Newton's 'absolute time' that 'flows uniformly without relation to anything external' to
Einstein's [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] four-dimensional curved space-time-continuum. Quantum theoretical
considerations [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] led to the idea of smallest units in space and time and
pragmatically we describe temporal phenomena using discrete time in suitable granularities
from years to nano-seconds. The investigation of biological and sociological systems
led to general system theory [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], the development of computers initiated automata
theory [
        <xref ref-type="bibr" rid="ref1 ref11">1,11</xref>
        ], Petri nets [
        <xref ref-type="bibr" rid="ref29 ref30">29,30</xref>
        ], and mathematical system theory [
        <xref ref-type="bibr" rid="ref20 ref22 ref26 ref47">20,22,26,47</xref>
        ]. More
recently processes [
        <xref ref-type="bibr" rid="ref32 ref33">32,33</xref>
        ] were investigated using situation calculus [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], event
calculus [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], temporal logics [
        <xref ref-type="bibr" rid="ref14 ref15 ref36">14,15,36</xref>
        ], data base theory including Knowledge
Discovery in Databases [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], and description logics [
        <xref ref-type="bibr" rid="ref2 ref25 ref31">2,25,31</xref>
        ].
      </p>
      <sec id="sec-1-1">
        <title>1.1 What is a system, what is a state?</title>
        <p>
          For any two of these theories the system descriptions are different, and Lin [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] states
in his book 'General Systems Theory: A Mathematical Approach', p. 347:
There might not exist an ideal definition for general systems, upon which a general
systems theory could be developed so that this theory would serve as the theoretical
foundation for all approaches of systems analysis, developed in various disciplines.
Though nearly all of the above mentioned theories have some formal or intuitive
notion of a 'state' of a system a precise definition of a 'state' seems to be very difficult.
Zadeh ([
          <xref ref-type="bibr" rid="ref48">48</xref>
          ], p.40) wrote in his paper 'The Concept of State in System Theory':
To define the notion of state in a way which would make it applicable to all systems is
a difficult, perhaps impossible, task. In this chapter, our modest objective is to sketch
an approach that seems to be more natural as well as more general than those
employed heretofore, but still falls short of complete generality.
        </p>
        <p>Clearly, a general definition of 'state' can be given only within a general system
description – and that should cover the most simple and useful system descriptions
namely protocols of statements or measurements taken at some 'real system'. While
arbitrary statements about a 'real system' are formally represented by n-ary relations
measurements and their values at a certain 'object' or at a certain 'point of time' are
usually represented in data tables, hence by a ternary relation interpreted as 'the
measurement taken at a certain point of time yields a certain value'.</p>
      </sec>
      <sec id="sec-1-2">
        <title>1.2 Data Tables, Concept Lattices, and States</title>
        <p>
          The practical relevance of data tables for knowledge representation in general and the
theoretical importance of lattices introduced by Birkhoff [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] led Wille [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ] to the
basic notion of a 'formal concept' of a given 'formal context' and the introduction of
Formal Concept Analysis. The standard reference is Ganter, Wille [
          <xref ref-type="bibr" rid="ref17 ref18">17,18</xref>
          ]. For earlier
related work the reader is referred to Barbut [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] and Barbut, Monjardet [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. The
connection to arbitrary data tables, formally described as many-valued contexts, was
investigated in the Research Group Concept Analysis at Darmstadt University of
Technology and led to the development of Conceptual Scaling Theory [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
Applications of Formal Concept Analysis to temporal data led the author to the idea
that the notion of 'state' should be defined as a formal concept of a suitable formal
context which describes the observations at a 'real system'. Therefore, a general
system description was needed. It should contain a general time description and a
description of events such that the states of the system are related to these descriptions
in a simple and meaningful way, for example, that a system is at each 'point of time'
in exactly one state. These ideas led the author to the development of a Conceptual
System Theory [
          <xref ref-type="bibr" rid="ref42 ref45">42,45</xref>
          ] where the definition of a Conceptual Time System was
introduced. In contrast to many other theories these systems are described from the data
side and not from the side of the laws. Then laws can be defined using implications,
clauses and, more generally, the object distribution [
          <xref ref-type="bibr" rid="ref46">46</xref>
          ].
        </p>
      </sec>
      <sec id="sec-1-3">
        <title>1.3 Granularity and Conceptual Scaling</title>
        <p>
          Besides that 'data – law polarity' the representation of granularity plays an important
role. It seems to be obvious that the choice of a coarser granularity in the data yields
fewer states. Therefore, to define 'states' a granularity tool should be introduced in the
formal description of a system. In Conceptual Time Systems the granularity tool is
Conceptual Scaling Theory which yields flexible possibilities for the generation of
mental frames. These frames are constructed as concept lattices of formal contexts
(called scales) which are used to describe the contextual meaning of the values of
many-valued contexts ([
          <xref ref-type="bibr" rid="ref16 ref18">16,18</xref>
          ]). Each many-valued context together with a family of
scales generates a formal context, the derived context ([
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], p.38). The concept lattice
of the derived context can be embedded into the direct product of the concept lattices
of the chosen scales. The indiscernability classes of objects in the derived context
describe the granularity generated by these scales on the object set of the given
manyvalued context.
        </p>
        <p>
          Conceptual Scaling Theory is closely related to other granularity describing theories,
as for example Fuzzy Theory (Zadeh [
          <xref ref-type="bibr" rid="ref49 ref50">49,50</xref>
          ], Wolff [
          <xref ref-type="bibr" rid="ref40 ref41">40,41</xref>
          ]), Rough Set Theory
(Pawlak [
          <xref ref-type="bibr" rid="ref27 ref28">27,28</xref>
          ], Wolff [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ]) and the theory of information channels in the sense of
Barwise and Seligman [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] as described by the author [
          <xref ref-type="bibr" rid="ref44">44</xref>
          ].
        </p>
      </sec>
      <sec id="sec-1-4">
        <title>1.4 Time in Conceptual Time Systems</title>
        <p>
          Now, we shortly discuss the formal representation of 'time' in Conceptual Time
Systems. There are many possibilities to represent 'time' in many-valued contexts. A
simple and often used way is to collect all the data for a given 'time point' in a row of
a data table. But what is a 'time point'? Should we start with a set of 'time points' used
as formal objects of a many-valued context? Should we introduce a linear ordering on
this set? Should we introduce intervals of a linearly ordered set of time points? How
to represent the non-linear ordering of the intervals? Should we introduce time
measurements as many-valued attributes of a many-valued context? What is the role of
other measurements in space or other domains?
To give a short answer: we introduce a set G whose elements are called 'time
granules' or 'time objects'. They play the role of 'elementary pieces of time' or 'time
instants' like 'morning' and they are contextually described by two many-valued
contexts T and C on the same set G of time granules. The first many-valued context T,
called the 'time part' describes the time granules by time measurements, for example,
the time granule 'morning' begins at 9 and ends at 12 o'clock. The second
manyvalued context C, called the 'event part' describes all other measurements taken at the
'real system'. Each many-valued attribute in the time part and the event part has a
conceptual scale describing the granularity we wish to use for its values.
That simple and general framework of a Conceptual Time System together with
Conceptual Scaling Theory [
          <xref ref-type="bibr" rid="ref16 ref18">16,18</xref>
          ] allows for introducing states as object concepts of the
event part. The idea of a space-time description of a system leads to the definition of
the 'general phase space' as a concept lattice from which the state space can be
obtained by a simple projection omitting the time part. That includes the classical state
spaces in physics as well a discrete state spaces in psychology, biology, linguistics,
and computer sciences.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2 Example: Temporal Concept Analysis of Some Observations of</title>
    </sec>
    <sec id="sec-3">
      <title>Stars</title>
      <p>The following example serves for several purposes: At first we use it to demonstrate
(for readers not familiar with Formal Concept Analysis) a formal context, its concept
lattice, object concepts, attribute concepts and line diagrams. Then we use it as the
derived context of a conceptual time system, for the introduction of 'conceptual time
systems with parts', 'object construction', and 'conceptual time systems with actual
objects'.</p>
      <sec id="sec-3-1">
        <title>2.1 Observing Stars</title>
        <p>
          The following Table 1 is a cross-table of a formal context K = (G,M,I) with 4 objects
and 7 attributes. It is understood as a short protocol of some observations of stars.
Reading example: Observation 1 has the attributes 'Monday', 'morning', 'east' and
'luminous'. The attributes 'east' and 'morning' have the same attribute concept, namely
the concept (A,B) with the extent A = {1,3} and the intent B = {east, morning,
luminous}. The two object concepts of 1 and 3 are sub-concepts of (A,B). For an
introduction to FCA the reader is referred to [
          <xref ref-type="bibr" rid="ref38 ref39">38,39</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>2.2 A Conceptual Time System</title>
        <p>The following Table 2 describes in some sense the 'same' situation as Table 1. Indeed,
Table 1 is the derived context of the conceptual time system given by Table 2 and the
scales in Table3. There are four 'time objects' or 'time granules', labeled 1,2,3,4,
interpreted as 'pieces of time' during which some measurements took place. For each
time object g there is a time description of g (in the second and third column) and an
event description (in the fourth and fifth column).
In the general definition of a conceptual time system such tables are described by two
many-valued contexts on the same set G of 'time objects'. By definition a conceptual
time system contains also for each of its many-valued attributes a scale. In this
example the scales are given by the following Table 3 (using some abbreviations):
Mo
Tu</p>
        <p>Mo
×</p>
        <p>Tu
×
mo
ev
mo
×
ev
×
east
west
west
×
lum
lum
×</p>
        <p>
          To get a flavour of the rich possibilities of conceptual scaling the reader is referred to
Wolff [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ], Ganter, Wille [
          <xref ref-type="bibr" rid="ref16 ref18">16,18</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3 Conceptual System Theory</title>
      <p>
        At first we give a short description of Conceptual System Theory developed by the
author [
        <xref ref-type="bibr" rid="ref42 ref45">42,45</xref>
        ]. The basic notion in Conceptual System Theory is that of a Conceptual
Time System which is used as a quite general definition of a system. In contrast to
system descriptions using laws Conceptual Time Systems describe the observations
taken at 'real systems'. While system descriptions using laws (for example differential
equations) do not refer in their theoretical framework to the 'dirty data' and the
granularity of the data Conceptual Time Systems represent the data as well as a
granularity tool, namely the conceptual scales. The implications and clauses in the
resulting derived contexts yield the laws which are valid in these systems with respect
to the chosen granularity.
      </p>
      <sec id="sec-4-1">
        <title>3.1 Conceptual Time Systems</title>
      </sec>
      <sec id="sec-4-2">
        <title>Definition: 'conceptual time system'</title>
        <p>Let G be an arbitrary set and T := ((G, M, W, IT), (Sm | m ∈ M)) and
C := ((G, E, V, I), (Se | e ∈ E )) scaled many-valued contexts (on the same object set
G). Then the pair (T, C) is called a conceptual time system on G.</p>
        <p>T is called the time part and C the event part of (T, C).</p>
        <p>The elements of the set G are called time granules or time objects, interpreted as
pieces of time like 'morning' which are described by time measurements, formally
represented by the many-valued attributes of the many-valued context (G, M, W, IT).
The scales Sm of the time measurements m ∈ M describe the granularity of this
conceptual 'language' about the values of the time measurements. The many-valued
context (G, E, V, I) of the event part C is interpreted as the measurement table of the
events of that system. The scales Se of the events e ∈ E describe the chosen
granularity for the values of the event measurements.</p>
      </sec>
      <sec id="sec-4-3">
        <title>3.2 States in Conceptual Time Systems</title>
        <p>In a conceptual time system (T, C) we would like to say 'The system is at time
granule g in state s(g)'. This is introduced in the following definition where the object
concepts of the derived context KC are defined as the states. As to the time part we
call the object concepts of the derived context KT the time states or time granule
concepts.</p>
      </sec>
      <sec id="sec-4-4">
        <title>Definition: 'state space of a conceptual time system'</title>
        <p>Let (T, C) be a conceptual time system and KT and KC the derived contexts of T and
C. For each time granule g we define the state s(g) of (T, C ) at time granule g by
s(g) := γC(g) := the object concept of g in KC and the time state or time granule
concept t(g) of (T, C ) at time granule g by t(g) := γT(g) := the object concept of g in K .
T
The set S(T, C):= {s(g) | g ∈ G } is called the state space of (T, C). We say that the
system (T, C) is at time granule g in the state s ∈ S(T, C) iff s = s(g).
This definition yields the 'partition meaning' of states, namely, that the set G of time
granules is partitioned by the extents of the states, or, equivalently, that a system is at
each time granule in exactly one state. Clearly, for any two time granules g and h,
s(g) = s(h) iff for each event e the values e(g) and e(h) have the same scale attributes
and therefore the same object concept in the scale Se.</p>
        <p>For the following discussion we need the notion of a subsystem of a conceptual time
system and an embedding of the concepts of a subsystem into the concept lattice of
the given system.</p>
      </sec>
      <sec id="sec-4-5">
        <title>3.3 States in Subsystems</title>
      </sec>
      <sec id="sec-4-6">
        <title>Definition: 'subsystem of a scaled many-valued context'</title>
        <p>
          Let C = ((G, E, V, I), (Se | e ∈ E )) be a scaled many-valued context; for an arbitrary
subset R ⊆ E let IR := {(g,e,v) ∈ I | e ∈ R}. Then
C(R) := ((G, R, V, IR), (Se | e ∈ R )) is called the R-part of C or a subsystem of C.
Analogously we define the 'R-part of a formal context (G, M, I)' (where R ⊆ M);
([
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], p. 98).
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Definition: 'part embedding φR'</title>
      <p>Let K := (G, M, I) be a formal context, and R ⊆ M, and K(R) the R-part of K. Then
the mapping φR which maps each concept (A,B) of K(R) onto the concept φR((A,B))
:= (A,A↑) of K with the same extent, but possibly a larger intent A↑ in K is called the
part embedding from B(K(R)) into B(K).</p>
      <p>
        The part embedding φR is a meet-preserving order-embedding ([
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], p.98). It
demonstrates the difficulties that arise, if one does not distinguish between the states of a
system and the states of a subsystem. It was shown by the author in [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ] that φR is not
state preserving which led to the notion of 'general time granules' and 'general states'
for arbitrary concepts of KT and K .
      </p>
      <p>C</p>
      <sec id="sec-5-1">
        <title>3.4 Phase Spaces</title>
        <p>
          In classical Mathematical System Theory [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] a phase of a system is a pair (t, s) of a
point t of time and a state s. This classical division is represented in the notion of a
conceptual time system (T, C), which allows us to introduce the notion of the phase
space of an arbitrary conceptual time system [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ].
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>Definition: 'phase space of a conceptual time system'</title>
        <p>Let (T, C) be a conceptual time system on G and KT and KC the derived contexts of T
and C.</p>
        <p>The apposition KT|KC of the derived contexts is called the phase context of (T, C).
The concept lattice B(KT|KC) is called the phase space of (T, C).
For any 'general time granule' (A,B) ∈ B(KT) and any 'general state' (C,D) ∈ B(KC)
we say, that the system (T, C) is during the general time granule (A,B) always in the
general state (C,D) iff A ⊆ C (which is equivalent to φT(A,B) ≤ φC(C,D) in
B(KT|KC), where φT and φC are the part embeddings of B(KT) and B(KC) into
B(KT|KC)). And we say, that the system (T, C) is during the general time granule
(A,B) sometimes [never] in the general state (C,D) iff A ∩ C ≠ ∅
[resp. A ∩ C = ∅].</p>
        <p>In Table 1 the formal context K is the apposition of KT (with 4 time attributes) and
KC (with 3 event attributes). For time granule 1 the pair (t(1), s(1)) is the 'first' phase
of this system, where t(1) = ({1}, {Monday, morning}) and s(1) = ({1,3}, {east,
luminous}). By the previous definition (T, C) is during time granule 1 always in the
state s(1) since φT(t(1)) = ({1}, {Monday, morning, east, luminous}) ≤ ({1,3},
{morning, east, luminous}) = φC(s(1)) in B(K) = B(KT|KC).</p>
      </sec>
      <sec id="sec-5-3">
        <title>3.5 Object Construction and Object – Time Duality</title>
        <p>If we interpret the observations in the previous example as being caused by a single
star, then this star could be nicely represented by the attribute concept of 'luminous'.
The extent of this concept describes the time when this star was 'discovered' by the
observation of its 'permanent' attribute 'luminous'. This star looks like a 'planet' since
'it moves' in the state space.</p>
        <p>If we interpret the same observations as being caused by two stars, namely the
'morning star' which 'always' (Monday and Tuesday) occurs in the morning in the east, and
the 'evening star' which 'always' occurs in the evening in the west, then these two stars
look like fixed stars. The 'morning star' can be nicely represented as the formal
concept ({1,3}, {morning, east, luminous}). Clearly, we could explain these observations
also by four stars which might be represented as the object concepts of the four time
granules.</p>
        <p>This example shows that Conceptual Time Systems might be useful to understand
from a philosophical point of view the role of objects, its construction from temporal
phenomena and therefore its intimate relationship to our notion of time. For further
discussions I call this relationship the 'object – time duality'. Is there any meaningful
connection to the 'particle – wave duality' or the complementarity of energy and time?</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>4 Formal Representations of Time Objects and 'Usual' Objects</title>
      <p>Clearly, since time granules are used as formal objects in conceptual time systems the
introduction of 'usual' objects like 'morning star' leads to the problem of the formal
representation of them. Let us assume that we have accepted two objects 'morning
star' and 'evening star'; then we might introduce these two stars as subsystems of a
system of some stars. The following definition describes such conceptual time
systems with (some selected ) subsystems or parts.</p>
      <sec id="sec-6-1">
        <title>4.1 Conceptual Time Systems with Parts</title>
        <p>In applications a conceptual time system with parts might describe not only its
specified subsystems but also the relations among these subsystems, for example the flow
of information among several participants of a computer network.</p>
      </sec>
      <sec id="sec-6-2">
        <title>Definition: 'conceptual time system with parts'</title>
        <p>Let (T, C) be a conceptual time system, T = ((G, M, W, IT), (Sm | m ∈ M)),
C = ((G, E, V, I), (Se | e ∈ E )) and P some index set. If for each p ∈ P Tp is the M –
p
part of T for some Mp ⊆ M and Cp is the Ep –part of C for some Ep ⊆ E then
(T, C, ((Tp, Cp) | p ∈ P)) is called a conceptual time system with parts from P.
observ.</p>
        <p>day
Monday
Monday
Tuesday
Tuesday
day time
morning
evening
morning
evening</p>
        <p>morning star
space brightness
east luminous</p>
        <p>/ /
east luminous
/ /</p>
        <p>evening star
space brightness</p>
        <p>/ /
west luminous</p>
        <p>/ /
west luminous
In Table 4 the time part of the 'morning star' is described by the columns 1,2,3 and the
event part by the columns 1,4,5.</p>
        <p>The corresponding scales are chosen as nominal scales for 'day' and 'day time' and as
the following scales (scaling also the missing value "/") for the columns 4,5,6,7 :</p>
        <p>The set P of parts is chosen as {morning star, evening star}, their time parts are
chosen as T, their event parts are described by columns 4, 5 respectively 6, 7
(together with the corresponding scales).</p>
      </sec>
      <sec id="sec-6-3">
        <title>4.2 Subposition of Parts: Actual Objects</title>
        <p>In many applications objects are introduced as something which is relatively stable,
but sometimes objects are changing quite rapidly with time. Then we usually combine
such an object with a 'piece of time' as for example 'my father in his youth' or the
'morning star at Monday morning'.
If we like to use the parts as new objects, then it is very natural to combine a part p
and a time granule g to a pair (p,g). This is done in the following example.
observation
(ms,1)
(ms,2)
(ms,3)
(ms,4)
(es,1)
(es,2)
(es,3)
(es,4)</p>
        <p>day
Monday
Monday
Tuesday
Tuesday
Monday
Monday
Tuesday
Tuesday
day time
morning
evening
morning
evening
morning
evening
morning
evening
space
east</p>
        <p>/
east
/
/
west</p>
        <p>/
west
brightness
luminous</p>
        <p>/
luminous
/
/
luminous</p>
        <p>
          /
luminous
In Table 6 the information of Table 4 (where the parts are graphically represented
using apposition of their tables) is now represented using subposition of their tables.
(For a definition of apposition and subposition the reader is referred to [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], p. 40.)
In general we take some of the elements of P×G as time objects of a new conceptual
time system with a suitable time part (representing some common aspect of the time
parts Tp , p ∈ P) and a suitable event part (representing some common aspect of the
event parts Ep , p ∈ P) usually with suitable refinements in the scales. Then we obtain
a 'conceptual time system with actual objects' in the sense of the following definition.
        </p>
      </sec>
      <sec id="sec-6-4">
        <title>Definition: 'conceptual time system with actual objects'</title>
        <p>Let P and G be sets and Π ⊆ P×G , then a conceptual time system (T,C) on Π is
called a conceptual time system with actual objects from P×G. P is called the set of
objects or particles, G the set of time points and Π the set of actual objects (which is
the set of time granules of (T,C)).</p>
        <p>Clearly, each conceptual time system with actual objects can be transformed (in many
ways) into a conceptual time system with parts. While in conceptual time systems
with parts for each time granule g the intent of g (in the derived context) contains all
the information given in all parts, 'this information' is distributed over the intents of
all actual objects (p,g). The details of these constructions are not explained here.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>5. Applications</title>
      <p>
        Conceptual time systems with actual objects can be used to represent the development
of many objects in a common phase space or – omitting the time part – in a common
state space. Classical examples are a swarm of birds or a physical system of particles.
The author has applied this method in cooperation with a computer firm in the
production of wafers based on process data of a reactor; it was applied in a chemical
plant for the visualization of a chemical process in a distillation column [
        <xref ref-type="bibr" rid="ref45">45</xref>
        ]. Now we
describe two applications in greater detail, one in an air-conditioning plant and the
other in a therapeutic treatment of an anorectic young woman.
      </p>
      <sec id="sec-7-1">
        <title>5.1 A Phase Space of an Air-Conditioning Plant</title>
        <p>In this application an air-conditioning plant in the pharmaceutical industry was
investigated to control the behavior of the plant. Therefore several temperature time series
were collected. The usual visual inspection of these discrete data represented in
'curves' finds some phases which occur nearly every day, for example the phase that
during the afternoon the temperature outside and inside is relatively high.
To represent such phases systematically we constructed several conceptual time
systems with different scales based on the same many-valued context describing the
original temperature measurements taken at each hour of the first six months (=182
days) of the year 2000 using 4368 = 182 x 24 hours as time objects. Each hour is
described in the time part by three attributes 'month', 'day', and 'hour' where the values
of 'hour' range from 0 to 23. Clearly, the temperature measurements form the event
part.</p>
        <p>To demonstrate the method we take from these data only the first three days and only
two temperatures, namely the outside temperature and the temperature in one of the
production rooms. For the 72 = 3 x 24 hours we use labels, for example '100' for the
midnight hour of the first day, and '323' for the last hour of the third day. The line
diagram in Figure 2 shows the phase space of a conceptual time system using an
ordinal scale with five concepts for the attribute 'hour' and two ordinal scales each
with three concepts for the temperatures inside and outside.</p>
        <p>The process starts at midnight of the first day (in the phase of time granule 100)
where the temperatures outside and inside are low. The system changes to another
phase at time granule 108, but remains in the same state. After time granule 110 the
system changes to a state with a medium inside temperature. The change to the phase
of 112 shows that the transitions between two phases clearly need not follow the lines
of the line diagram. Omitting the 'hour'-attributes we get the projection of this phase
space onto the state space (described by the six points in the upper-left part) which
can be embedded into a 3 x 3 –grid spanned by the two 3-chains for the temperatures.
A typical phase space implication: hour:&gt;=16 ⇒ Temp-outside:&lt;=6.0.</p>
      </sec>
      <sec id="sec-7-2">
        <title>5.2 A State Space of a Therapeutic Process of an Anorectic Young Woman</title>
        <p>
          In the following example a conceptual time system with actual objects is described.
We represent a therapeutic process of an anorectic young woman over a period of
about three years [
          <xref ref-type="bibr" rid="ref34 ref35">34,35</xref>
          ]. During the course of treatment at four points of time the
patient was asked to describe herself and her family using a repertory grid. This is a
many-valued context where (in this example) the objects are the members of the
family denoted by SELF (the patient), FATHER, MOTHER, together with IDEAL
(self-ideal of the patient). The many-valued attributes are self-chosen pairs of
constructs like 'rational - emotional' and the values are marks from 1 to 6, for example
'1' for 'very rational' and '6' for 'very emotional'. Application of Formal Concept
Analysis led to four concept lattices – one for each time point. Since the chosen
attributes changed from time point to time point there was no common formal
framework for the representation of the whole process. Therefore the 'main
information' in these four repertory grids was described by the therapeut using a
suitable common set of attributes for all points of time. The following line diagram
demonstrates the state space of the corresponding conceptual time system with 16
actual objects (for example SELF1 denotes SELF at time point 1).
From the line diagram in Figure 3 we see for example that SELF1 and SELF3 are in
the same state described by the attributes 'pessimistic', 'self-accusation', 'distrust', and
'reduced spontaneity'. SELF2 has only the first two of these attributes while SELF4
has none of the used attributes just like her IDEAL at the time points 2, 3, and 4. The
development of the FATHER is quite remarkable since he is stable during the first
three time points in the state 'self-accusation', 'distrust', and 'reduced spontaneity' and
in the forth time point he is judged as having all of the used attributes except the
attribute 'morally closed' which was used for none of the 'actual persons'.
This investigation is based on a long cooperation with my friend Norbert
Spangenberg [
          <xref ref-type="bibr" rid="ref34 ref35">34,35</xref>
          ] at the Sigmund-Freud-Institute Frankfurt.
        </p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>6 Future Research in Temporal Concept Analysis</title>
      <p>The actual state of Formal Concept Analysis and Conceptual System Theory seems to
be a promising starting point for a new discipline in Conceptual Knowledge
Processing namely Temporal Concept Analysis understood as the theory of temporal
phenomena described with tools of Formal Concept Analysis. On the basis of a clear
definition of states and phases as formal concepts a general description of temporal
phenomena in all areas of science can be developed.</p>
      <p>
        One of the next steps will be a conceptual transition theory such that transitions in
automata theory [
        <xref ref-type="bibr" rid="ref1 ref11">1,11</xref>
        ] and in the theory of Petri Nets [
        <xref ref-type="bibr" rid="ref29 ref30 ref7">7,29,30</xref>
        ] can be understood in
a temporal conceptual framework. Future research is necessary for the conceptual
understanding of temporal logics, temporal dependencies and temporal relational
structures.
      </p>
      <p>
        For the application of Temporal Concept Analysis programs have to be developed
which represent complex temporal systems in easily understandable visualizations.
One of the most promising possibilities are conceptual movies introduced by the
author [
        <xref ref-type="bibr" rid="ref42 ref45">42,45</xref>
        ]. A diploma thesis on conceptual movies was written by Freimuth [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <sec id="sec-8-1">
        <title>Acknowledgments:</title>
        <p>I like to thank Prof. Walter Sedelow for his encouragement and his help during the
development of this research area and for his suggestion to introduce the name
'Temporal Concept Analysis'.</p>
        <p>Thanks also to the firm NAVICON GmbH Frankfurt for the permission for using their
excellent programs on Conceptual Knowledge Processing in their NAVICON DECISION
SUITE.</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>7 References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Arbib</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          :
          <article-title>Theory of Abstract Automata</article-title>
          . Prentice Hall, Englewood Cliffs,
          <string-name>
            <surname>N.J.</surname>
          </string-name>
          ,
          <year>1970</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <source>Proceedings of the International Workshop on Description Logics</source>
          , Aachen, Germany,
          <year>2000</year>
          . Electronically available as
          <source>CEUR Workshop Proceedings</source>
          Volume
          <volume>33</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Barbour</surname>
          </string-name>
          , J.:
          <source>The End of Time: The Next Revolution in Physics</source>
          . Oxford University Press,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Barbut</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Note sur l'algèbre des techniques d'analyse hiérarchique</article-title>
          . Appendice de: L'
          <article-title>analyse hiérarchique (Matalon, B</article-title>
          .). Gautiers-Villars,
          <year>Paris 1965</year>
          ,
          <fpage>125</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Barbut</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Monjardet</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Ordre et classification</article-title>
          ,
          <source>Algèbre et Combinatoire</source>
          .
          <volume>2</volume>
          <fpage>tomes</fpage>
          . Paris, Hachette,
          <year>1970</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Barwise</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seligman</surname>
          </string-name>
          , J.:
          <source>Information Flow - The Logic of Distributed Systems</source>
          . Cambridge Tracts in Theoretical Computer Science 44,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Baumgarten</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Petri-Netze - Grundlagen und Anwendungen. BI-Wiss</surname>
          </string-name>
          .-Verlag,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Bertalanffy</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <year>v</year>
          .:
          <article-title>General System Theory</article-title>
          . George Braziller, New York,
          <year>1969</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Bettini</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montanari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <source>Proceedings Eighth International Symposium on Temporal Representation and Reasoning TIME 2001. IEEE Computer Society</source>
          , Los Alamos, California,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Birkhoff</surname>
          </string-name>
          , G.:
          <article-title>Lattice theory</article-title>
          . 3rd ed.,
          <source>Amer.Math.Soc.</source>
          ,
          <year>Providence 1967</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Brauer</surname>
          </string-name>
          , W.:
          <string-name>
            <surname>Automatentheorie</surname>
            .
            <given-names>B.G. Teubner</given-names>
          </string-name>
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Einstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Relativity - The Special and the General Theory. A Popular Exposition</article-title>
          . Routledge, London,
          <year>1960</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Freimuth</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Begriffliche Visualisierung zeitabhängiger Systeme.
          <source>Diploma thesis</source>
          , University of Applied Sciences Darmstadt,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Gabbay</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>I. Hodkinson</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Reynolds: Temporal Logic - Mathematical Foundations and Computational Aspects</article-title>
          . Vol.
          <volume>1</volume>
          , Clarendon Press Oxford
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Gabbay</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>C.J.</given-names>
            <surname>Hogger</surname>
          </string-name>
          ,
          <source>J.A. Robinson: Handbook of Logic in Artificial Intelligence and Logic Programming</source>
          , Vol.
          <volume>4</volume>
          , Epistemic and
          <string-name>
            <given-names>Temporal</given-names>
            <surname>Reasoning</surname>
          </string-name>
          , Clarendon Press, Oxford,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , R. Wille:
          <article-title>Conceptual Scaling</article-title>
          . In: F.Roberts (ed.)
          <article-title>Applications of combinatorics and graph theory to the biological and</article-title>
          social sciences,
          <volume>139</volume>
          -
          <fpage>167</fpage>
          . Springer Verlag, New York,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , R. Wille: Formale Begriffsanalyse: Mathematische Grundlagen. Springer-Verlag, Berlin-Heidelberg
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , R. Wille:
          <article-title>Formal Concept Analysis: mathematical foundations. (translated from the German by Cornelia Franzke</article-title>
          ) Springer-Verlag, Berlin-Heidelberg
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.Holland, P.:
          <source>The Quantum Theory of Motion</source>
          . Cambridge University Press, Cambridge,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Kalman</surname>
            ,
            <given-names>R.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Falb</surname>
            ,
            <given-names>P.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Arbib</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          :
          <article-title>Topics in Mathematical System Theory</article-title>
          .
          <string-name>
            <surname>McGraw-Hill Book</surname>
          </string-name>
          Company, New York,
          <year>1969</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Kowalski</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.J.</given-names>
            <surname>Sergot</surname>
          </string-name>
          :
          <article-title>A Logic-Based Calculus of Events</article-title>
          .
          <source>New Generation Computing</source>
          <volume>4</volume>
          ,
          <fpage>67</fpage>
          -
          <lpage>95</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Lin</surname>
          </string-name>
          , Y.:
          <source>General Systems Theory: A Mathematical Approach</source>
          . Kluwer Academic/ Plenum Publishers, New York,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Maier</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>The theory of relational databases</article-title>
          . Computer Science Press,
          <year>Rockville 1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>McCarthy</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          : Situations, Actions, and
          <string-name>
            <given-names>Causal</given-names>
            <surname>Laws</surname>
          </string-name>
          . Reprinted in: Minsky, M. (ed.):
          <article-title>Semantic Information Processing</article-title>
          . MIT Press, Cambridge 1963, MA.
          <fpage>410</fpage>
          -
          <lpage>418</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Explaining Reasoning in Description Logics</article-title>
          ,
          <source>Ph.D. thesis</source>
          , Rutgers University, NJ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Mesarovic</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.D.</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Takahara</surname>
          </string-name>
          : General
          <source>Systems Theory: Mathematical Foundations</source>
          . Academic Press, London,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          : Rough Sets.
          <source>International Journal of Computer and Information Sciences</source>
          ,
          <volume>11</volume>
          ,
          <year>1982</year>
          ,
          <fpage>341</fpage>
          -
          <lpage>356</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Rough Sets: Theoretical Aspects of Reasoning About Data</article-title>
          . Kluwer Academic Publishers,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Petri</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          : Kommunikation mit Automaten.
          <article-title>Schriften des Instituts für instrumentelle Mathematik</article-title>
          .
          <source>Bonn 1962. English translation in technical report RADX-TR65-377</source>
          , Griffiss Air Force Base,
          <year>1966</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Petri</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          :
          <article-title>Introduction to General Net Theory</article-title>
          . In: Brauer,
          <string-name>
            <surname>W</surname>
          </string-name>
          . (ed.):
          <source>Net Theory and Applications. LNCS 84</source>
          , Springer-Verlag
          <year>1980</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Schild</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <article-title>Querying Knowledge and Data Bases by a Universal Description Logic with Recursion, Universität des Saarlandes</article-title>
          , Saarbrücken, Germany,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Sowa</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Knowledge Representation: Logical, Philosophical,</article-title>
          and Computational Foundations, Brooks/Cole, Pacific Grove, CA,
          <year>2000a</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Sowa</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Processes and Causality</article-title>
          . http://bestweb.net/~sowa/ontology/causal.htm,
          <year>2000b</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Spangenberg</surname>
          </string-name>
          , N.:
          <article-title>Familienkonflikte bei eßgestörten Patientinnen: Eine empirische Untersuchung mit Hilfe der Repertory Grid Technik</article-title>
          .
          <article-title>Habilitationsschrift im Fachbereich Humanmedizin der Justus-Liebig-</article-title>
          <string-name>
            <surname>Universität Giessen</surname>
          </string-name>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Spangenberg</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>Datenreduktion durch die Formale Begriffsanalyse von Repertory Grids</article-title>
          . In:
          <article-title>Einführung in die Repertory Grid-Technik, Band 2</article-title>
          ,
          <string-name>
            <given-names>Klinische</given-names>
            <surname>Forschung</surname>
          </string-name>
          und Praxis. (eds.:
          <string-name>
            <given-names>J.W.</given-names>
            <surname>Scheer</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.Catina)</surname>
          </string-name>
          ,
          <source>Verlag Hans Huber</source>
          ,
          <year>1993</year>
          ,
          <fpage>38</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.van Benthem,
          <string-name>
            <given-names>J.: Temporal</given-names>
            <surname>Logic</surname>
          </string-name>
          . In: Gabbay,
          <string-name>
            <surname>D.M.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.J.</given-names>
            <surname>Hogger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.A.</given-names>
            <surname>Robinson</surname>
          </string-name>
          <article-title>: Handbook of Logic in Artificial Intelligence and Logic Programming</article-title>
          . Vol.
          <volume>4</volume>
          , Epistemic and
          <string-name>
            <given-names>Temporal</given-names>
            <surname>Reasoning</surname>
          </string-name>
          . Clarendon Press, Oxford,
          <year>1995</year>
          ,
          <fpage>241</fpage>
          -
          <lpage>350</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.:
          <article-title>Restructuring lattice theory: an approach based on hierarchies of concepts</article-title>
          .
          <source>In: Ordered Sets (ed. I.Rival)</source>
          .
          <source>Reidel, Dordrecht-Boston</source>
          <year>1982</year>
          ,
          <fpage>445</fpage>
          -
          <lpage>470</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.:
          <article-title>Introduction to Formal Concept Analysis</article-title>
          . In: G. Negrini (ed.):
          <article-title>Modelli e modellizzazione. Models and modelling</article-title>
          .
          <source>Consiglio Nazionale delle Ricerche</source>
          ,
          <source>Instituto di Studi sulli Ricerca e Documentatione Scientifica</source>
          ,
          <year>Roma 1997</year>
          ,
          <fpage>39</fpage>
          -
          <lpage>51</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>A first course in Formal Concept Analysis - How to understand line diagrams</article-title>
          . In: Faulbaum,
          <string-name>
            <surname>F</surname>
          </string-name>
          . (ed.):
          <source>SoftStat ´93, Advances in Statistical Software 4</source>
          ,
          <string-name>
            <given-names>Gustav</given-names>
            <surname>Fischer</surname>
          </string-name>
          Verlag,
          <year>Stuttgart 1994</year>
          ,
          <fpage>429</fpage>
          -
          <lpage>438</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>Conceptual Interpretation of Fuzzy Theory</article-title>
          . In: Zimmermann,
          <string-name>
            <surname>H.J.</surname>
          </string-name>
          :
          <source>EUFIT´98, 6th European Congress on Intelligent Techniques and Soft Computing</source>
          ,
          <year>Aachen 1998</year>
          , Vol. I,
          <fpage>555</fpage>
          -
          <lpage>562</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>Concepts in Fuzzy Scaling Theory: Order and Granularity</article-title>
          .
          <source>7th European Conference on Intelligent Techniques and Soft Computing, EUFIT´99. Preprint Fachhochschule Darmstadt</source>
          ,
          <year>1999</year>
          .
          <article-title>Submitted for publication in FUZZY SETS AND SYSTEMS</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>Concepts, States, and Systems</article-title>
          . In: Dubois, D.M. (ed.):
          <article-title>Computing Anticipatory Systems</article-title>
          . CASYS´
          <fpage>99</fpage>
          - Third International Conference, Liège, Belgium,
          <year>1999</year>
          , American Institute of Physics Conference Proceedings
          <volume>517</volume>
          ,
          <year>2000</year>
          , pp.
          <fpage>83</fpage>
          -
          <lpage>97</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          43.
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>A Conceptual View of Knowledge Bases in Rough Set Theory</article-title>
          .
          <source>Proceedings of the Second International Conference on Rough Sets and Current Trends in Computing. Technical Report CS-2000-07</source>
          , Department of Computer Science, University of Regina,
          <fpage>188</fpage>
          -
          <lpage>192</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          44.
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>Information Channels and Conceptual Scaling</article-title>
          . In: Stumme, Gerd (ed.)
          <article-title>Working with Conceptual Structures</article-title>
          . Contributions to ICCS 2000. Shaker Verlag, Aachen,
          <year>2000</year>
          ,
          <fpage>277</fpage>
          -
          <lpage>283</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          45.
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>Towards a Conceptual System Theory</article-title>
          . In: B.
          <string-name>
            <surname>Sanchez</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Nada</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rashid</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Arndt</surname>
          </string-name>
          , M. Sanchez (eds.)
          <source>Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, SCI 2000</source>
          , Vol. II: Information Systems Development,
          <source>International Institute of Informatics and Systemics</source>
          ,
          <year>2000</year>
          , p.
          <fpage>124</fpage>
          -
          <lpage>132</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          46.
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          :
          <article-title>Conceptual Descriptions of Systems: Data and Laws</article-title>
          . Accepted for publication in: D.M.Dubois (ed.)
          <source>Computing Anticipatory Systems - CASYS´</source>
          <year>2000</year>
          ,
          <string-name>
            <given-names>Conference</given-names>
            <surname>Proceedings</surname>
          </string-name>
          . American Institute of Physics.
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          47.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Desoer</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Linear System Theory - The State Space Approach. McGraw-Hill Book</surname>
          </string-name>
          Company,
          <year>1963</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          48.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <article-title>The Concept of State in System Theory</article-title>
          . In: M.D. Mesarovic: Views on
          <article-title>General Systems Theory</article-title>
          . John Wiley &amp; Sons, New York,
          <year>1964</year>
          ,
          <fpage>39</fpage>
          -
          <lpage>50</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          49.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <article-title>Fuzzy sets</article-title>
          .
          <source>Information and Control 8</source>
          ,
          <year>1965</year>
          ,
          <fpage>338</fpage>
          -
          <lpage>353</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          50.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <article-title>The Concept of a Linguistic Variable and its Application to Approximate Reasoning</article-title>
          .
          <source>Part I: Inf. Science</source>
          <volume>8</volume>
          ,
          <fpage>199</fpage>
          -
          <lpage>249</lpage>
          ;
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          :
          <source>Inf. Science</source>
          <volume>8</volume>
          ,
          <fpage>301</fpage>
          -
          <lpage>357</lpage>
          ;
          <string-name>
            <surname>Part</surname>
            <given-names>III</given-names>
          </string-name>
          :
          <source>Inf. Science</source>
          <volume>9</volume>
          ,
          <fpage>43</fpage>
          -
          <lpage>80</lpage>
          ,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>