<!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>Embedding Temporal Description Logic Ontologies by Cone-based Geometric Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mena Leemhuis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Free University of Bozen-Bolzano</institution>
          ,
          <addr-line>Universitätsplatz 1, 39100 Bozen/Bolzano</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <fpage>28</fpage>
      <lpage>34</lpage>
      <abstract>
        <p>The embedding of description logic ontologies into low dimensional vector spaces is, e.g., in the context of knowledge graph embedding, an established option to do for example link prediction or concept membership prediction with the help of background information in form of an ontology. However, it is not only of interest to model expressive description logics such as ℒ but also to model temporal aspects, thus the evolution of concepts over time geometrically. Therefore, there is a need to model operators such as, e.g., eventually or next, thus temporal description logics geometrically. In this paper, an approach for embedding an expressive Boolean temporal description logic based on the embedding of concepts as closed convex cones is presented and it is proven that an ontology is satisfiable in the classical sense if and only if it is satisfiable in a geometric model based on the presented embedding. This model is a first step towards a learning approach able to model background information in form of an expressive temporal description logic ontology.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Temporal Description Logics</kwd>
        <kwd>Neuro-symbolic AI</kwd>
        <kwd>Knowledge Graph Embedding</kwd>
        <kwd>Convex Cones</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Though subsymbolic learning approaches gained
importance due to good-quality results in the last years, they
lack important features such as explainability and
trustworthiness. This led to the research area of Neuro-Symbolic
AI [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] which is based on the idea of combining
subsymbolic and symbolic approaches to use both information
on similarity of instances and the ability to do
deductive reasoning on the symbolic level. One way of
tackling this neuro-symbolic combination is pursued in the
area of knowledge graph embedding (KGE), where
knowledge graphs (thus, (, , )-triples
such as (, , )) are embedded into a
lowdimensional vector space by modeling instances (thus
 and ) as points in this space and relations
(thus ) as geometric operations between these
points. This enables to do for example link prediction, thus
the prediction of new triples based on given ones. One
prominent example is TransE [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] where relations are
represented as vector translations. However, not only instance
information but also information on concepts and their
interaction can be modeled, e.g., to predict only relations
fulfilling some background knowledge statements, for
example enforcing that the relation is capital of needs to have
the object being a country. Therefore, it is necessary to be
able to embed expressive background logic ontologies.
      </p>
      <p>
        Those approaches are based on the idea of embedding
concepts as convex sets in a vector space and logical
operations between concepts as geometrical operations between
those sets, e.g., representing concept conjunction as set
intersection. An instance belonging to a concept is then
modeled as a point in the convex set representing this
concept. For those instances, e.g., relations between them or
their concept membership can be predicted. The approaches
are, e.g., able to model the description logic (DL) ℰ ℒ++, e.g.,
by representing concepts as boxes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] or spheres [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Some
approaches are even able to model full concept negation
and disjunction, thus the DL ℒ, e.g., based on subspaces
10th Workshop on Formal and Cognitive Reasoning (FCR-2024) at the 47th
German Conference on Artificial Intelligence (KI-2024, September 23 - 27),
Würzburg, Germany
$ menahildegard.leemhuis@unibz.it (M. Leemhuis)
https://orcid.org/0000-0003-1017-8921 (M. Leemhuis)
© 2024 Copyright for this paper by its authors. Use permitted under Creative Commons License
Attribution 4.0 International (CC BY 4.0).
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] or closed convex cones [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]. The approach of Özçep et
al. [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ] shows that ℒ-ontologies are satisfiable if and
only if they are satisfiable by a geometric model based on
closed convex cones.
      </p>
      <p>
        However, concepts are normally not static but evolve
over time. A cured person is, for example, a person who has
recovered from an illness. Therefore, to model the concept
of cure, it is necessary to model both the concepts of
healthiness and of illness and a temporal combination thereof. To
model such ideas, temporal logic can be used and, in the
context of ontologies, this leads to the area of several diferent
temporal description logics (see, e.g., [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] for a survey).
      </p>
      <p>This directly leads to the question whether existing
approaches for embedding ℒ can be extended to model
also temporal aspects and especially whether such a model
has the same expressivity as the DL interpretation, thus,
whether a temporal DL-ontology is satisfiable if and only if
the corresponding geometric model is satisfiable.</p>
      <p>
        Though, temporal knowledge graph embeddings are a
widely studied topic (see, e.g., [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] for a survey), to the best
of the author’s knowledge, there are no approaches
incorporating background information in form of an expressive
temporal description logic ontology.
      </p>
      <p>
        The basic idea is to extend the cone-based embedding of
Özçep et al. [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ] by modeling the passing of time as an
increasing distance to the point of origin. Thus, on each
sphere with the point of origin as center, the concepts of one
time point are modeled. An instance is represented as a ray
and thus the intersections of the ray with diferent spheres
can be considered to determine the concept membership
of the instance and especially the change of the concept
membership of this instance. Thus both are modeled, the
operators of classical description logic (by considering
concepts at the same distance) and the temporal operators (by
considering the concepts being on a ray starting at the point
of origin).
      </p>
      <p>In contrast to classical KGE-approaches, the focus lies
here on representing concepts and their temporal aspects
and not on relations. Thus, a Boolean temporal
ℒontology is considered. The main result is that it is actually
possible to model temporal DL-ontologies via those
models based on cones, namely that a temporal DL-ontology is
satisfiable if and only if it is satisfiable in such a geometric
model.</p>
      <p>
        After a short introduction to the description logic ℒ
and to the temporal description logic  ℒ in Section 2,
in Section 3, the cone embedding of Özçep et al. [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ] is
introduced. In Section 4, the extension of the cone
embedding to the temporal case is presented and the expressivity
of this approach is discussed in Section 5. The paper ends
with a short conclusion.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Preliminaries</title>
      <p>In the following, the description logic ℒ and the temporal
description logic  ℒ is shortly introduced.</p>
      <sec id="sec-2-1">
        <title>2.1. Description Logic</title>
        <p>
          We are going to work with the description logic of Boolean
ℒ, i.e., ℒ without considering roles [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. We assume
that there is a DL vocabulary given by a set of constants 
and a set of concept names  . The ℒ concepts (concept
descriptions) over  are described by the grammar
 →−
        </p>
        <p>| ⊥ | ⊤ | ¬ |  ⊓  |  ⊔ 
where  ∈  is an atomic concept and  stands for
arbitrary concepts. A classical ℒ interpretation is a pair
(∆ , (· )ℐ ) consisting of a set ∆ , called the domain, and an
interpretation function (· )ℐ which maps constants to
elements in ∆ , concept names to subsets of ∆ , and role names
to subsets of ∆ × ∆ . The semantics of arbitrary concept
descriptions for a given interpretation ℐ is as follows:
• ⊤ℐ = ∆
• ⊥ℐ = ∅
• ( ⊓ )ℐ = ℐ ∩ ℐ
• ( ⊔ )ℐ = ℐ ∪ ℐ
• (¬)ℐ = ∆ ∖ ℐ
An ontology  is defined as a pair  = ( , ) of a
terminological box (TBox)  and an assertional box (ABox) . A
TBox consists of general inclusion axioms (GCIs)  ⊑  (“
is subsumed by ”) with concept descriptions , . An
ABox consists of a finite set of assertions, i.e., facts of the
form () for  ∈ . An interpretation ℐ models a GCI
 ⊑ , for short ℐ |=  ⊑ , if ℐ ⊆ ℐ . An
interpretation ℐ models an ABox axiom (), for short ℐ |= (),
if ℐ ∈ ℐ . An interpretation is a model of an ontology
( , ) if it models all axioms appearing in  ∪ . An
ontology  entails a (TBox or ABox) axiom , for short
 |= , if all models of  are also models of .</p>
        <p>Each TBox  generates a Boolean algebra, the so-called
Lindenbaum-Tarski algebra, as follows: For concepts , 
let ∼ be the relation defined by  ∼  if  |=  ⊑ 
and  |=  ⊑ . Relation ∼ is an equivalence relation
inducing for each concept  an equivalence class [].
Deifne operations ⊓, ⊔, ¬ on the equivalence classes by setting
[]⊓[] = [ ⊓], []⊔[] = [ ⊔] and ¬[] = [¬]
which can be shown to fulfill the axioms of a Boolean
algebra.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Temporal Description Logic</title>
        <p>
          There are several diferent temporal description logics, for
a survey, see, e.g., [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Here,  ℒ [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] is considered,
as it is a widely known, expressive temporal description
logic. Here, a slight adaptation is used, namely roles are
28–34
not considered, thus the consideration is restricted to the
Boolean part. As temporal operators, ∘ (at the next moment),
◇ (eventually), □ (always in the future) and  (until) are
used. The temporal ℒ concept descriptions over 
are described by the grammar for ℒ extended with the
following
 →− · · · | ∘
        </p>
        <p>| ◇  | □  |  
Note that ◇  is used as shorthand for ⊤  and □  as
shorthand for ¬ ◇ ¬ .</p>
        <p>A temporal interpretation  = (∆ , (· ) ) is based on a
non-empty domain ∆ and an interpretation function  that
maps every concept name  ∈  to a subset  ⊆ N× ∆
and every individual name  ∈  to an element  ∈ ∆ .
(, ) ∈  describes that  is an instance of  at time
point . Constants are considered as rigid, meaning they are
interpreted the same way at every time point. Additionally,
the constant domain assumption is assumed to be valid,
meaning that constants are not destroyed or created over time.
Though, there are diefrent interpretations possible, here the
standard assumption of a bounded past and an unbounded
future is used, where the time flow is discrete. Thus, the
time is represented as (N, &lt;). Alternatively, it is possible to
interpret a temporal interpretation as an infinite sequence
 (0),  (1), . . . of (non-temporal) interpretations based on
the same domain ∆ .</p>
        <p>The semantic is defined based on the semantic for ℒ
with the extension of
• (∘ ) = {(, ) | ( + 1, ) ∈  }
• ( ) = {(, ) | ∃ ≥ ((, ) ∈  ∧
(, ) ∈  for  ≤  &lt; )}.</p>
        <p>A temporal interpretation  is a model of a concept  if 
is satisfied at time point 0, i.e., (0, ) ∈  for some  ∈ ∆ .
An interpretation  is a model of a TBox  if and only if
 ⊆  for all  ⊑  in  .</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Cone Embeddings</title>
      <p>
        The geometric interpretation that is used as basis for the
embedding approach introduced in this paper was presented
by Özçep et al [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ] and is based on closed convex cones and
a special case of it, the axis-aligned cones. A closed convex
cone  is a non-empty set for which if ,  ∈ , then also
 +  ∈  for all ,  ≥ 0. In the following, the term
“cone” refers to closed convex cones. A polar cone ∘ of a
closed convex cone  is defined as
      </p>
      <p>
        ∘ = { | for all  ∈  : ⟨, ⟩ ≤ 0},
where ⟨· , ·⟩ denotes the usual scalar product. Now, the
DLinterpretation can be interpreted geometrically: The domain
∆ is interpreted as R and a concept interpretation ℐ is
interpreted as cone , the negation of this concept (¬)ℐ
as its polar ∘ , the conjunction of two concepts as set
intersection between the respective cones and disjunction via
de Morgan. An instance belonging to a concept is then
represented as a point in the respective cone. Based on this
interpretation, it can be shown that each set of cones in
R closed under set-intersection and polarity leads to an
orthologic [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. It is possible to restrict the cones to so-called
axis-aligned cones (al-cones for short). Özçep et al [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] show
that an ℒ-ontology is satisfiable if and only if there is
an al-cone model of that ontology. An al-cone is defined as
follows:
 is al-cone :⇔
 = 1 × · · · ×
      </p>
      <p>,  ∈ {R, R+, R− , {0}},
where R+ = { ∈ R |  ≥ 0} and R− = { ∈ R |
 ≤ 0}. Thus, al-cones can be considered as unions of
neighboring hyperoctants. So, in  dimensions we have 4
possible al-cones. Conjunction, disjunction and negation
are defined analogously to the case of closed convex cones,
as al-cones are a specialization.</p>
      <p>Example 1. An example for a cone-model can be seen in
Figure 1 on the left, an example for an al-cone model in Figure 1
in the middle. In both of them, the TBox { ⊑ } is modeled.
First consider the cone model: The dashed cone on the upper
left is the interpretation of the concept , fulfilling the
TBoxaxiom, as it is a subset of the gray cone, the interpretation of
. The negation of concept  is interpreted as the polar cone
of cone ℐ , thus the cone containing all rays having an angle
of 90∘ or more to all rays in in ℐ . Conjunction is interpreted
as set intersection, thus ( ⊓ ¬)ℐ is the gray, dashed cone
in the top right. Disjunction can be determined via de Morgan,
thus, e.g., ( ⊔ ¬)ℐ would be (¬(¬ ⊓ ))ℐ , thus the
polar of the gray, dashed cone in the upper right, therefore the
convex hull of the cones of ℐ and (¬)ℐ . ABox-instances
are interpreted as points in the space, therefore an instance 
with () would be placed in the cone ℐ as ℐ .</p>
      <p>The al-cone example in Figure 1 in the middle represents
the same TBox, however, based on a restricted cone model
not based on arbitrary but axis-aligned cones. There,  is
interpreted as positive -axis and  is interpreted as upper
right quadrant. The polar al-cones are defined the same as
for the case of classical cones, thus, for example, (¬)ℐ is the
lower left quadrant.</p>
      <p>In both cases, ⊥ is interpreted as point of origin, as there
all cones intersect, leading to a contradiction, thus to ⊥ℐ .</p>
      <p>An al-cone interpretation can be defined formally as
follows:
Definition 1. [6, Definition 1] A Boolean al-cone
interpretation ℐ is a structure (∆ , (· )ℐ ) where ∆ is R for some  ∈ N,
and where (· )ℐ maps each concept symbol  to some al-cone
and each constant  to some element in ∆ ∖ {⃗0}. An al-cone
interpretation for arbitrary Boolean ℒ concepts is
deifned recursively as (⊤)ℐ = ∆ , (⊥)ℐ = {⃗0}, ( ⊓ )ℐ =
ℐ ∩ ℐ , (¬)ℐ = ∘ , and ( ⊔ )ℐ = (¬(¬ ⊓ ¬))ℐ .</p>
      <p>The notions of an al-cone being a model and that of
entailment are defined as in the classical case (but using al-cone
interpretations).</p>
      <p>This then leads to the following proposition:
Proposition 1. [6, Proposition 2] Boolean ℒ-ontologies
are classically satisfiable if and only if they are by a geometric
model on some finite R based on al-cones of the form 1 ×
· · · ×  with  ∈ {{0}, R+, R− , R} for  ∈ {1, . . . , }.</p>
      <p>The aim of this paper is to show a similar result for
temporal description logics.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Embedding of Temporal DL</title>
      <p>When considering those cone models, it gets apparent that
on each ray (a ray through a point  ∈ R contains all
 for  ≥ 0) only one concept is represented and that
instances placed on such a ray are indistinguishable on a
conceptual level. Therefore, without loss of expressivity
it is possible to model an al-cone model instead of in R
on the unit -sphere (an unit -sphere can be defined as
 = { ∈ R : ‖‖ = 1}) and thus gain the space to
model temporal aspects.</p>
      <p>Example 2. In Figure 1 on the right an example for a
geometric model based on a sphere can be seen for a simple ontology
with only one concept . This concept is represented as a
sphere part with radius one in the upper right quadrant. It is
based on the al-cone of the upper right quadrant where each
vector in this al-cone is set to unit length. ℐ can easily be
extended into an al-cone by considering the convex closure
of it. The easiest way to determine the negation of  is to
consider the al-cone extension of ℐ (thus, the upper right
quadrant), taking the polarity (the lower left quadrant) and
then intersect it with a sphere of radius one, leading to the
sphere part that can be seen in the figure. An instance  with
() can then be placed on the sphere part representing 
with ||ℐ || = 1.</p>
      <p>It can be shown that both the al-cone model and the
sphere model have in fact the same expressivity.
Proposition 2. Boolean ℒ-ontologies are satisfiable by
a geometric model on some finite R based on al-cones of
the form 1 × · · · ×  with  ∈ {{0}, R+, R− , R}
for  ∈ {1, . . . , } if and only if they are satisfiable by a
geometric model on some finite  (with  ≤ 2) where
concepts are represented as intersection between al-cones and
the unit sphere.</p>
      <p>
        → The concept representation can be directly
transformed to a spherical representation without
loss of expressivity, as for a concept ℐ for each
 ∈ ℐ , |||| ∈ ℐ . Therefore, it is possible to
interpret a concept ℐ = { |  ∈ ℐ,cone&amp;|||| =
1}, where ℐ,cone represents the original concept
representation as al-cone. It can be trivially seen
that the represented TBox-axioms do not change.
The instances can then be placed on the unit sphere
in the same manner as it is done for the construction
of the al-cone model in the proof of Proposition 1
(as can be seen in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]). The only problem arises if a
concept lies on an axis, as then only one instance can
be represented as belonging to this concept. This
can, however, be solved by using the same
construction principle as in the proof of Proposition 8 of
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], namely increasing the number of dimensions by
creating a geometric mod of size R2 based on two
concatenations of the original model in R. Thus,
if a concept is, e.g., placed at point (1, 0), then two
dimensions can be added having the same concept
memberships as the first two dimension. Then, this
concept is no longer at point (1, 0) but on the
circle segment between (1, 0, 0, 0) and (0, 0, 1, 0) and
thus allows for placing arbitrary many diferent
instances on this segment.
      </p>
      <p>A diference to the cone-based model is that ⊥ℐ is no
longer represented as {0} but as ∅ which, however,
does not influence the satisfiability.</p>
      <p>Assume a geometric model based on a sphere  for
 &gt; 0 is given. As each concept ℐ is based on the
intersection of the unit sphere with an al-cone, it is
trivially possible to extend the representation on the
sphere to an al-cone again such that for ℐ, =
{ |  ∈ ℐ &amp; ≥ 0} (thus by considering the
convex hull).</p>
      <p>The interpretation of instances does not change.</p>
      <p>Note that the increase of dimensions depends on the
structure of the cone-based model and thus, the doubling of
dimensions is only an upper bound.</p>
      <p>When reducing an al-cone model to a sphere model, this
opens up the opportunity to model spheres of diferent radii
in a vector space, thus modeling diferent geometric models
in the same vector space, as Proposition 2 is trivially
adaptable to a sphere of a diferent radius. This directly leads to
the possibility of modeling temporal description logics: As
each temporal interpretation can be modeled as a sequence
 (0),  (1), . . . of non-temporal interpretations, it is
possible to model each  () on a sphere with radius  + 1 in
the vector space ( + 1 is considered, as  (0) is interpreted
as model on the unit sphere). To follow the assumption that
instances are rigid, each instance is represented as a ray,
interfering with all spheres, thus with concepts of all time
points. Then, an instance has an interpretation for each
time point, thus for each distance 1, 2, . . . to the point of
origin.</p>
      <p>Now, the classical operators need to be adjusted to model
the temporal case and the temporal operators need to be
defined. The domain ∆ is, in contrast to the ℒ-case
not represented as R but as the set of unit vectors in R,
28–34
thus ∆ = { | |||| = 1&amp; ∈ R}. The tuple (, ), thus
an instance at a specific time point is then represented as
( + 1) ·  for  ∈ ∆ and a concept  is represented as
 = {( + 1) ·  |  ∈  ()}. Then, the interpretation
of ∘ and  can be straightforwardly adapted.</p>
      <p>(∘ ) ={( + 1) ·  | ( + 2) ·  ∈  }
(1)
( ) ={( + 1) ·  | ∃ ≥  : ( + 1) ·  ∈ 
&amp;( + 1) ·  ∈  for  ≤  &lt; )}</p>
      <p>The temporal interpretation of each time step leads to
the representation of concepts as sphere parts. Now the
question arises how the concepts look like when
considering them in a combination of all time steps. The main
observation is that the resulting sets are neither closed
convex cones nor al-cones anymore, as for a point in a concept
not necessarily the ray through this point is contained in
that concept. It needs to be examined in a practical setting
whether there are concepts which are rigid or at least
constant in several successive time steps to be able to use the
advantages of convexity as much as possible. However, if
only one time step is considered, then it is again possible to
consider closed convex cones, resp. al-cones by using the
construction mentioned in the proof of Proposition 2.</p>
      <p>This directly leads to the definition of a temporal cone
interpretation, following and extending the ideas of the
classical cone interpretation of Definition 1.</p>
      <p>Definition 2. A temporal al-cone interpretation  is a
structure (∆ , (· ) ) where ∆ is the set of unit vectors in R
for some  ∈ N and where (· ) maps each concept symbol
 for each radius  to a union of intersections of al-cones and
the sphere with radius  for  ∈ {1, . . . , } for  ∈ N or for
 ∈ N and each constant to an element of ∆ .</p>
      <p>• ( ⊓ ) =  ∩ 
• (¬) defined based on the polarity of 
intersected with a sphere of radius |||| for  ∈ 
• ∘ ,  as denoted in Equation (1) and
• ◇ , □ and ⊔ interpreted via the other operators as stated
above</p>
      <p>
        The construction is in the following illustrated by an
example taken from [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>Example 3. As an example, a TBox is modeled which
contains the statement that any non-EU country has to be first
an EU-member candidate before it can be an EU-member:
¬ _ ⊓ ◇  _ ⊑
◇ ( _   _)
One exemplary model can be seen in Figure 2. The first model
for time step 0 is on the sphere with radius 1. At this time
point, there aren’t any EU-candidates but some EU-members.
Then, to fulfill the axiom, there must be a point in time where
a non-EU-member is included into the EU, this is modeled
here in the second time step (in the al-cone model
concatenated with a sphere with radius three) in the upper right
quadrant. To model the subsumption mentioned in the axiom,
it is necessary to incorporate the concept of a EU-candidate.
Whereas at time step 0, there weren’t any EU-candidates, in
the first time step, the instances in the upper right quadrant
became EU-candidates. Those instances are in the second time
step EU-members, thus, the axiom is fulfilled for the upper
right quadrant. The other three quadrants do not fulfill the
premise of the subsumption, as either the instances are not
a non-member of the EU or they aren’t becoming a
member eventually. In this low dimensional example, there are
concepts represented by a point at a time step, meaning that
only one instance can be placed in this concept. This can be
solved by increasing the dimension of the model, as described
in the proof of Proposition 2 and is omitted here for readability
reasons.</p>
      <p>
        One basic property of cone-based models is their ability
to model unknown or indeterminable information: the
socalled faithfulness [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] of the model. This term denotes that,
e.g., in Figure 1 in the middle an instance placed in the lower
right quadrant can belong to  or to ¬. Thus, if in an ABox
no information on the membership to  of this instance is
given, then it is not necessary to chose one of the two, but
it is possible to model this missing knowledge. This ability
can also be used in the cone-based model in the temporal
description logic setting, as will be argued in detail below
based on the previous example.
      </p>
      <p>Example 4 (Example 3 continued). As stated before, the
upper right quadrant of the model in Figure 2 fulfills the premise
and the conclusion of the stated axiom. The axes represent
some atomic concepts. The other three quadrants, however,
allow for the incorporation of faithfulness: The most obvious
case is the lower left quadrant, there it is at no time point
known whether a state is member of the EU or not, however, it
is known that the state is definitely not a candidate (assume
for example that someone has created the ABox
knowledgeable about EU-candidates and the plans which states will be
candidates, but not as knowledgeable about the history of
the EU and the actual members). The lower right quadrant
denotes states which are at the moment neither member nor
candidate but for which it is at least thinkable of that they
are maybe later on a candidate and a member. The upper left
quadrant denotes states where it is known for some point in the
future that they will be EU-members, however, it is not known
whether they are members already or need to be candidates
ifrst.</p>
      <p>This example illustrates the wide possibilities of using
faithfulness in the context of temporal models. Due to the
restricted size of the model, it is not possible to model each
possibility for unknown information, it is however, possible
to focus on specific possibilities which should be modeled.</p>
      <p>These temporal cone models can be used as basis for a
learning approach. One option would be to extend the
approach to the handling of relations (and thus to leave the
Boolean case) and to do temporal knowledge graph
embedding. The cone models in the form presented here also
enable for embedding approaches by themselves, e.g.,
having a training set with instances, their attributes and their
concept memberships and a test set only with instances
and their attributes to predict the concepts. Additionally,
possibly a temporal DL-ontology is given. Then, an
embedding can be learned, e.g., via a neural network, where the
optimizing function is on the one hand based on the axioms
of the ontology and on the other hand based on the correct
placement of instances. By choosing a suficient dimension
of the cone model, it is possible to find a trade of between
faithfulness on the one site and recall on the other.
1
0
(¬)0
(¬)1
(¬)2
1</p>
      <p>2
1
(¬)0
2</p>
      <p>3
(¬)1
28–34</p>
    </sec>
    <sec id="sec-5">
      <title>5. Expressivity</title>
      <p>
        The construction principle mentioned in the last section is
usable for modeling background knowledge in form of an
ontology in a learning approach, as there it is mostly
appropriate to model an approximation of the ontology. However,
when there is a need for modeling the ontology exactly, it is
necessary to prove that each classically satisfiable ontology
is also satisfiable when considering the proposed
embedding. In the following, a theorem proves this statement for
 ℒ ontologies and temporal embeddings as proposed
in Definition 2. The proof for the case of Boolean ℒ
in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] without temporal aspects is based on the fact that
the ontology consists of a finite number of atomic concepts
which can be placed on the half axes of the geometric model
(thus, e.g., on R+ × { 0} × · · · × { 0}) and thus are the basis
for the other concepts. This is in this case not possible, as
here not only one interpretation  needs to be considered
but a number of interpretations for diferent time points
 (0),  (1), . . . . To solve this problem, the ultimately
periodic model property for temporal logic is used to restrict
the number of time steps needed for the model.
Theorem 1 (Ultimately Periodic Model Property). [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ] A
LTL formula  is satisfiable if and only if there is an ultimately
periodic model  such that  is fulfilled, thus there is ,  ∈ N
such that there is a model where  () =  ( + ) for all
 ≥  and period , where  is a finite starting index.
      </p>
      <p>With the help of this theorem, it is possible to prove the
following main result of this paper, stating the strong
connection between temporal cone embeddings and  ℒ
ontologies.</p>
      <p>Theorem 2. A Boolean  ℒ -ontology with constant
domains is satisfiable if it has a geometric model on some finite
R based on a temporal al-cone-interpretation as introduced
in Definition 2.</p>
      <p>Proof.</p>
      <p>→ The ultimately periodic model property of
Theorem 1 can be used as a basis for the
geometric model based on cones. Based on this theorem,
it is enough to model a finite set of interpretations
 (0), . . . ,  () up to the starting index  and
additionally the first period, thus,  ( + 1), . . . ,  ( +
). After the time point  + , the information on
the period can be used to define all following time
points based on the preceding ones, thus a further
modeling is not necessary. Therefore, there are only
ifnite many atomic concepts possible. Then it is
possible to create an intermediate al-cone model
where analogously to the proof of Proposition 1
each concept is placed on one half-axis. The
instances can then be interpreted as points in this
space as done in Proposition 1. This al-cone model
can then be modified to lead to a temporal
coneinterpretation as follows: First, for each atomic
concept, a temporal representation (thus based on a
representation for each time step) is created following
the rules of Equation (1). Then, the point 
representing an instance  in the intermediate model is
changed to a ray through the point of origin,
meaning ℐ = { |  ≥ 0}.</p>
      <p>Proposition 2 in combination with Proposition 1
shows that each sub-model  () for  ≥ 0
represents a satisfiable ℒ-ontology. As a temporal
DLinterpretation can be interpreted as combination of
classical interpretations  () for  ≥ 0 and the
operators modeled can be straightforwardly interpreted
as classical operators, the classical interpretation is
also satisfiable.</p>
      <p>Analogously to the case of cone models introduced in
Section 3, for the temporal case it is also possible to use instead
of al-cones cones as basis for the concept representation
and thus increase the expressivity beyond  ℒ .</p>
    </sec>
    <sec id="sec-6">
      <title>6. Related Work</title>
      <p>
        The embedding of temporal description logic is an important
research topic in KGE, as the triples stored in knowledge
graphs, e.g., (, , ) can be extended with
temporal information, as not all triples are valid at every time
point. If  and  are separated today, the triple can
be extended to (, , , 2023). There are several
KGE-approaches handling the embedding of this temporal
information (see, e.g., an extension of the classical
KGEapproach TransE, TTransE [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] or [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] for a survey). They
are, however, mostly only based on link prediction and don’t
incorporate concept information, e.g., in form of ontologies.
One related approach, though not incorporating
ontological information, has been presented by Dasgupta et al [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ],
modeling time points explicitly, however, not like in this
approach based on the distance to the point of origin but by
modeling each time point as an individual hyperplane. Thus,
an al-cone-like structure is used, however, not for modeling
conceptual information but time points. One approach able
to model first order logic is TFLEX [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], however, it still does
not incorporate concepts as set of a specific geometric
structure (e.g., convex sets). Zhang [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] introduces an embedding
based on a similar principle of modeling time steps based
on distances, however, does not model concepts explicitly.
There are several other approaches for embedding
ontologies geometrically, e.g., modeling ℰ ℒ++ with the help of
boxes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] or spheres [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] or ℒ based on subspaces [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
However, they do not incorporate temporal information.
      </p>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>
        In this paper, I have presented a model showing that for
temporal description logics similar approaches as for classical
description logics can be used to embed them into a vector
space, here demonstrated based on an adaptation of a model
based on closed convex cones. This is a first step towards a
learning approach which is not only able to model temporal
aspects regarding instances but also modeling their
conceptual behavior, thus it enables designing a learning approach
respecting background knowledge information. This model
opens up the opportunity to be extended to metric temporal
description logics (see, e.g., the work of Gutiérrez-Basulto
et al [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]) due to the possibility of representing distances
geometrically. Another possible extension of this approach
regards the consideration of roles. There are many
KGEapproaches incorporating temporal information, therefore,
it would be interesting to consider whether some of the
existing approaches of modeling relations can be used to
extend this approach and whether then Theorem 2 can be
extended to full ℒ. Leaving the context of description
logics, it would also be interesting to examine the
expressivity of a model not based on al-cones but on adaptations
of closed convex cones in general.
      </p>
    </sec>
    <sec id="sec-8">
      <title>8. Acknowledgments</title>
      <p>I acknowledge the financial support through the
‘Abstractron’ project funded by the Autonome Provinz Bozen
Südtirol (Autonomous Province of Bolzano-Bozen) through
the Research Südtirol/Alto Adige 2022 Call.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A. d.</given-names>
            <surname>Garcez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Lamb</surname>
          </string-name>
          ,
          <string-name>
            <surname>Neurosymbolic</surname>
            <given-names>AI</given-names>
          </string-name>
          :
          <article-title>The 3rd wave</article-title>
          ,
          <source>Artificial Intelligence Review</source>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bordes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Usunier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Garcia-Duran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Yakhnenko</surname>
          </string-name>
          ,
          <article-title>Translating Embeddings for Modeling Multi-relational Data</article-title>
          ,
          <source>in: NIPS'13: Proceedings of the 26th International Conference on Neural Information Processing Systems</source>
          ,
          <year>2013</year>
          , p.
          <fpage>2787</fpage>
          -
          <lpage>2795</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Leskovec,</surname>
          </string-name>
          <article-title>Query2box: Reasoning over Knowledge Graphs in Vector Space Using Box Embeddings</article-title>
          , arXiv (
          <year>2020</year>
          ). doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>2002</year>
          .
          <volume>05969</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kulmanov</surname>
          </string-name>
          , W. Liu-Wei,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hoehndorf</surname>
          </string-name>
          , EL Embeddings:
          <article-title>Geometric Construction of Models for the Description Logic EL++</article-title>
          , in: Proceedings of the Twenty-Eighth
          <source>International Joint Conference on Artificial Intelligence, IJCAI-19, International Joint Conferences on Artificial Intelligence Organization</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>6103</fpage>
          -
          <lpage>6109</lpage>
          . doi:
          <volume>10</volume>
          .24963/ijcai.
          <year>2019</year>
          /845.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Garg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ikbal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Srivastava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Vishwakarma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. P.</given-names>
            <surname>Karanam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. V.</given-names>
            <surname>Subramaniam</surname>
          </string-name>
          ,
          <article-title>Quantum embedding of knowledge for reasoning</article-title>
          ,
          <source>in: Neural Information Processing Systems</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>O. Lütfü</given-names>
            <surname>Özçep</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Leemhuis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wolter</surname>
          </string-name>
          ,
          <article-title>Cone semantics for logics with negation</article-title>
          ,
          <source>in: Proceedings of the Twenty-Ninth International Joint Conference on Artiifcial Intelligence, IJCAI-PRICAI-2020, International Joint Conferences on Artificial Intelligence Organization</source>
          ,
          <year>2020</year>
          . doi:
          <volume>10</volume>
          .24963/ijcai.
          <year>2020</year>
          /252.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Ö.</given-names>
            <surname>Özçep</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Leemhuis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wolter</surname>
          </string-name>
          ,
          <article-title>Embedding Ontologies in the description logic ALC by Axis-Aligned Cones</article-title>
          ,
          <source>Journal of Artificial Intelligence Research</source>
          <volume>78</volume>
          (
          <year>2023</year>
          )
          <fpage>217</fpage>
          -
          <lpage>267</lpage>
          . doi:
          <volume>10</volume>
          .1613/jair.1.13939.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Artale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Franconi</surname>
          </string-name>
          ,
          <article-title>A survey of temporal extensions of description logics</article-title>
          ,
          <source>Annals of Mathematics and Artiifcial Intelligence</source>
          <volume>30</volume>
          (
          <year>2000</year>
          )
          <fpage>171</fpage>
          -
          <lpage>210</lpage>
          . doi:
          <volume>10</volume>
          .1023/a:
          <fpage>1016636131405</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Temporal knowledge graph completion: A survey</article-title>
          ,
          <source>in: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-2023, International Joint Conferences on Artificial Intelligence Organization</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .24963/ijcai.
          <year>2023</year>
          /734.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F.</given-names>
            <surname>Baader</surname>
          </string-name>
          ,
          <article-title>Description logic terminology</article-title>
          , in: F.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          PatelSchneider (Eds.),
          <source>The Description Logic Handbook</source>
          , Cambridge University Press,
          <year>2003</year>
          , pp.
          <fpage>485</fpage>
          -
          <lpage>495</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wolter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakharyaschev</surname>
          </string-name>
          ,
          <article-title>Temporal description logics: A survey</article-title>
          ,
          <source>in: 2008 15th International Symposium on Temporal Representation and Reasoning</source>
          , IEEE,
          <year>2008</year>
          . doi:
          <volume>10</volume>
          .1109/time.
          <year>2008</year>
          .
          <volume>14</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Sistla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Clarke</surname>
          </string-name>
          ,
          <article-title>The complexity of propositional linear temporal logics</article-title>
          ,
          <source>Journal of the ACM</source>
          <volume>32</volume>
          (
          <year>1985</year>
          )
          <fpage>733</fpage>
          -
          <lpage>749</lpage>
          . doi:
          <volume>10</volume>
          .1145/3828.3837.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Demri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Goranko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lange</surname>
          </string-name>
          ,
          <string-name>
            <surname>Linear-Time Temporal</surname>
            <given-names>Logics</given-names>
          </string-name>
          , Cambridge Tracts in Theoretical Computer Science, Cambridge University Press,
          <year>2016</year>
          , p.
          <fpage>150</fpage>
          -
          <lpage>208</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Leblay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Chekol</surname>
          </string-name>
          ,
          <article-title>Deriving validity time in knowledge graph</article-title>
          ,
          <source>in: Companion of the The Web Conference 2018 on The Web Conference</source>
          <year>2018</year>
          , WWW '18, ACM Press,
          <year>2018</year>
          . doi:
          <volume>10</volume>
          .1145/3184558.3191639.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Dasgupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. N.</given-names>
            <surname>Ray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. P.</given-names>
            <surname>Talukdar</surname>
          </string-name>
          , Hyte:
          <article-title>Hyperplane-based temporally aware knowledge graph embedding</article-title>
          ,
          <source>in: Conference on Empirical Methods in Natural Language Processing</source>
          ,
          <year>2018</year>
          . URL: https: //api.semanticscholar.org/CorpusID:53082197.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>X.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sun</surname>
          </string-name>
          , et al.,
          <article-title>Tflex: temporal feature-logic embedding framework for complex reasoning over temporal knowledge graph</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>36</volume>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Hierarchy-aware temporal knowledge graph embedding</article-title>
          ,
          <source>in: 2022 IEEE International Conference on Knowledge Graph (ICKG)</source>
          , IEEE,
          <year>2022</year>
          . doi:
          <volume>10</volume>
          .1109/ickg55886.
          <year>2022</year>
          .
          <volume>00054</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>V.</given-names>
            <surname>Gutiérrez-Basulto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Jung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ozaki</surname>
          </string-name>
          ,
          <article-title>On metric temporal description logics</article-title>
          ,
          <source>in: European Conference on Artificial Intelligence</source>
          ,
          <year>2016</year>
          . URL: https: //api.semanticscholar.org/CorpusID:655770.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>