<!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>Versions and Applicability of Concept Definitions in Legal Ontologies?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Szymon Klarman</string-name>
          <email>sklarman@science.uva.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rinke Hoekstra</string-name>
          <email>hoekstra@uva.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marc Bron</string-name>
          <email>mbron@science.uva.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Leibniz Center for Law, University of Amsterdam PO</institution>
          <addr-line>Box 1030, 1000 BA, Amsterdam</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In many domains concept definitions undergo change on a relatively frequent basis. Especially in law, such changes can have far reaching consequences. Existing ontology versioning techniques often do not consider that old and new definitions may need to co-exist side by side in a knowledge base, or they require non-standard language extensions. In this paper we present a description logic based representation that allows us to model and switch between varying definitions of concepts in a single OWL ontology. We show how this representation can be used to model complex versioning schemes in law.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        A serious challenge for ontology design and maintenance, broadly discussed in the
recent literature (e.g. [
        <xref ref-type="bibr" rid="ref4 ref5 ref6">4, 6, 5</xref>
        ]), concerns handling dynamic aspects of represented
knowledge. A special case of that problem, which is in the focus of this paper, is
how to approach changes that affect the definitions of terms in a legal ontology.
Processes of definitional change are relatively common in many domains. New
scientific theories often lead to a revision of concepts such as the recent change
in the definition of ‘planet’. This is no different in law, where revised legislation
can impose a new interpretation on terms defined and used in older legislative
documents. Such changes can clearly have far reaching consequences from both
an epistemic and pragmatic perspective. For instance, definitional changes in
law can bring about new normative consequences and thus directly affect rights
and obligations of citizens.1
      </p>
      <p>A new concept definition entails a different classification of domain objects,
which can effect in a deep restructuring of the domain’s representation.
Consequently, reasoning over the revised ontology is unlikely to result in the original
? The work reported here was partially funded by the ESTRELLA IST-2004-027655
project, http://www.estrellaproject.org. This paper reflects the views of the
authors.
1 See e.g. the discussion on the changed definition of “Dependent” in the
“Working Families Tax Relief Act” (2004), cf. http://www.milliman.com/expertise/
employee-benefits/publications/bib/pdfs/BIB11-23-04-dependency.pdf.
set of conclusions. Especially in the case where a revised ontology is
incompatible with the original – the union of the two is unsatisfiable – the impact of a
change can be significant.</p>
      <p>However, there is a considerable asymmetry in the status granted to outdated
definitions in different domains. Scientific knowledge that is replaced by more
recent results is simply considered false and, hence, deprived of any substantial
value. It is always the current version of an ontology that is applied to provide
reliable explanations and predictions in science. Conversely, in law there is a
justified interest in keeping track of older versions. A legal case can be properly
assessed only according to law that is applicable at the time the case takes place.
Furthermore, the consideration and analysis of previous cases plays an important
role in the judicial process: previous representations of law have to stay available.
The revision that a legal ontology is submitted to in face of a definitional change
is therefore not that of a plain update but rather of versioning, and hence requires
a cautious approach.</p>
      <p>In this paper we address the problem of handling changes in the definitions of
concepts in (legal) ontologies and propose a description logic based
representation that provides a simple, but in many respects convenient ontology versioning
technique. The representation consists of a set of TBox and ABox axiom schemes,
which allow for reasoning about a domain within a declared time interval, strictly
according to concept definitions valid during that interval. In the next section we
review related work and formulate basic requirements for an ontology versioning
formalism. We then discuss an example model inspired by the Nomic game.2 We
close the paper with conclusions and discussion of the proposed solution.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Ontology Versioning</title>
      <p>Representing change and handling different variants of ontologies is the subject
of research on ontology evolution and ontology versioning. Ontology evolution
concerns changing an existing ontology while maintaining consistency. For
example, the removal of a concept from an ontology requires the deletion of all
references to this concept.</p>
      <p>
        Ontology versioning, on the other hand, takes a copy-first strategy where
changes are effected in a new, copied, version of an ontology. This usually
involves the recording of changes and relations between different versions: e.g. it
is useful to know if a new version is backward compatible with the previous
version. This can be essential information for proper functioning of ontology-driven
applications. A system that implements such a versioning system is e.g. SHOE
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Efforts at combining both strategies in a single system are described in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        However, these approaches are very much focused on the changes affected
during the development of an ontology, and do not consider the case where
multiple versions may independently hold. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] presents an approach where multiple
2 See http://www.nomic.net/, [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Nomic was implemented in ESTRELLA as an
OWL-DL ontology by Abdallah El-Ali and Xingrui Ji, along with the authors of
this paper.
versions can be represented in a single ontology file using time stamps. In this
approach, an ontology is described by a graph where each node (concept) and
edge (property) is annotated with a time stamp that indicates its validity. Such
a system can be implemented in three ways. First, using a meta ontology that
stores the different time stamped versions of an ontology and represents the
structural and temporal relations between those versions. Second, by an
extension of the knowledge representation language that can express time and change.
And finally, by exploiting the standard techniques provided by a representation
language to time stamp concepts, e.g. using the versionInfo and isDefinedBy
annotations in OWL.3
      </p>
      <p>These techniques have drawbacks when implemented in OWL. For instance,
if the time dimension is not considered by a reasoner, its conclusions may well be
incorrect: it should only infer conclusions that hold at a ‘current’ time. Another
drawback is that OWL does not guarantee correct interpretation of temporal
constraints, e.g. a relation can only exist between two concepts that are both
valid at the same time. Furthermore, a time stamping approach can cause a
snowball effect in the updates it requires. If, for example, a concept A has a
relation to concept B and which is updated to a new definition B0, then A has
to be updated to A0, so that the relation of A0 points to B0. Every concept with
a relation to the original A then needs to be revised as well, and so on and so
forth.</p>
      <p>Alternatively, one can handle versions of a definition by using rules that
classify only relevant individuals at particular points in time. In a rule language
like SWRL, the variants of e.g. “block” can be expressed as:</p>
      <sec id="sec-2-1">
        <title>Rule 1: square(?x) ∧ wood(?x) ∧ time(t1) ∧ exists at(?x, t1) ⇒ block(?x).</title>
      </sec>
      <sec id="sec-2-2">
        <title>Rule 2: rectangle(?x) ∧ metal(?x) ∧ time(t2) ∧ exists at(?x, t2) ⇒ block(?x).</title>
        <p>Although this approach would certainly tackle some of the problems discussed
above, applying a rule formalism in ontology modelling has its drawbacks. A
model can not only become undecidable, but the classification ‘by rules’ may
well conflict with DL-based inferencing in unexpected ways.
2.1</p>
        <p>
          Versioning and Applicability in Law
For the purposes of legal reasoning, an ontology is a particular interpretation of
the world that imposes an ordering on the actual entities of that world. Multiple
different orderings can hold at the same time, and may be compatible with
respect to the world, but not with respect to each other. On the other hand, the
conceptual framework of law is fairly stable and based largely in common sense
notions: it is generally an extension and refinement of common sense [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>The status of an officially sanctioned legal text – and consequently its
representation – such as a piece of legislation or court decision (jurisprudence) is
primarily determined by its relation to other texts. The body of legal texts
published within a jurisdiction usually is not consistent as such, and is governed by
3 Note that OWL 1.0 does not allow the annotation of axioms, where OWL 1.1 does.
three meta legal rules for conflict resolution: lex superior, lex specialis, and lex
posterior.</p>
        <p>
          The application of lex posterior, i.e. newer norms overrule old ones, to a set
of norms requires a clear insight in the temporal relations between these norms.
We can distinguish three types of time stamps used in legislation: version
management, determining the validity of a document for reference, drafting, relating
to the procedures that have to be followed by the issuer, and application to cases,
determining the relation of a norm to events in the world, e.g. for retroactive,
immediate or delayed application. Especially the last type makes law peculiar, as
activity and applicability can diverge, e.g. a currently active norm may not hold
for a current case. [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] proposes a simple event-based model to describe the
lifecycle of legal texts in the context of the MetaLex XML standard for legislative
sources [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].4 As regards version management, the status of a particular legal text
is successively fixed after drafting, knowable (published), active and repealed. In
MetaLex these are reflected by four time-related attributes: date-publication,
date-enacted, date-repealed, date-effective, see Table 1. A text is active if the
current date lies between the enactment and repeal date (or no repeal has taken
place); a text is applicable to a case if the date of the case is between the efficacy
and repeal date of that text. A formal representation of norms or regulations
needs to take into account how these intervals interact with concept definitions
in a legal ontology.
        </p>
        <p>We formulate the following requirements for versioning in legal ontologies. A
new version of a concept definition should have minimal impact on other
definitions. The versioning mechanism should be incremental, and prevent a snowball
effect of updates. Furthermore, multiple versions of a concept should be able
to co-exist within one ontology without causing inconsistencies or other
reciprocal effects. One should be able to switch between different versions of a
concept definition, while maintaining the ability to reason over version-independent
(common sense) concepts. The mechanism should be flexible enough to account
for the distinction between validity and applicability. And finally, it should ‘fit’
within a single general purpose knowledge representation formalism to allow for
sharing and reuse of ontologies.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Representing Definitional Change</title>
      <p>
        In the following, we propose a solution that allows to capture the core aspects of
concept versioning in a single OWL-DL ontology, while preserving the possibility
of using a standard reasoner for obtaining classifications that respect temporal
constraints imposed on the representation. To this end, we require a description
logic language as expressive as SHOIN , which is directly supported by
OWLDL. We refer to an arbitrary definitorial knowledge base K(T , A) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], consisting
of a set of concept names NC , role names NR and individual names NI , with a
model I = (ΔI , ·I ). A dynamic concept C, i.e. a concept whose meaning changes
4 See http://www.metalex.eu and http://legacy.metalex.eu
publication enacted
t1 t2
t1 t2
t1 t2
repealed
t4
t4
t4
effective
t2
t0
t3
over time, is represented in K by means of its all definitional variants. Further, we
provide a simple mechanism for selecting a valid time i ∈ {1, . . . , n}, such that
the respective version Ki of K has the same base interpretation as the original
ontology, but possibly a different extension Ji, yielding CJi = CiJi , where Ci
represents the proper variant of the concept C in time i.
      </p>
      <p>The representation has a three-layered structure, consisting of a simple
temporal framework, a collection of time stamps on individuals and a set of temporal
restrictions on concepts. The valid time selection is handled on the TBox level,
and allows alternative definitions of a designated concept.</p>
      <p>
        Temporal Framework The representation of time is based on interval algebra and
defined as a tuple hT, i, which constitutes a discrete, finite time axis, whose
atoms are undecomposable time intervals [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], and where is a total order on
T . We represent this in K by means of a primitive concept TimeInterval ∈ NC ,
such that TimeIntervalI 6= ∅, and a role beforeEq ∈ NR. The ABox has to be
equipped with a set of assertions guaranteeing that beforeEq is a total ordering
on TimeIntervalI , i.e. it is antisymmetric, transitive and complete. For more
flexibility we introduce an inverse relation: afterEq = beforeEq−.
      </p>
      <p>These constructs suffice as a frame of reference for representing temporal
aspects of definitional changes, including the dynamics of a domain on the level
of individuals.</p>
      <p>Valid Time In order to control the focus of a knowledge base we introduce a
mechanism for selecting the current ‘valid’ time. This is done by pointing to a
particular interval, with respect to which relevant concepts and individuals are
activated. Although there are other ways to achieve this, we propose a simple
method based on a single concept definition using a nominal. For some i, such
that intervaliI ∈ TimeIntervalI , let CurrentInterval ∈ NC be defined as:</p>
      <sec id="sec-3-1">
        <title>CurrentInterval ≡ {intervali}</title>
        <p>The rest of the formalism relies on the interpretation of the CurrentInterval.
This has two apparent advantages. First, it enables a very simple way for
switching between versions. Second, it does not affect the base interpretation of the
knowledge base, which may potentially simplify certain reasoning tasks. If two
knowledge bases K(T , A) and K0(T 0, A) differ from each other only with respect
to the choice of the current interval, none of the primitive concepts obtains a
different interpretation: a switch entails changes only for extensions of the base
interpretation.</p>
        <p>
          Stamps and Temporal Restrictions Individuals are indexed in time using the
relations from, to ∈ Nr. A time stamp links an individual to intervals of time,
marking exactly two limits of its existence in a domain of application [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]:
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>TimeStamped ≡ (∃from.TimeInterval u ≥ 1 from u ≤ 1 from) u (∃to.TimeInterval u ≥ 1 to u ≤ 1 to)</title>
        <p>In other words, for any individual a, such that TimeStamped(a), the ABox must
contain two assertions: from(a, intervali) and to(a, intervalj ), meaning that a came
into existence in intervali and ceased to exist in intervalj . Naturally, it should be
assured that 1 ≤ i ≤ j ≤ n.</p>
        <p>In order to enable an appropriate interaction between time-stamped
individuals and selected concepts, we will use the following axiom scheme:
GeneralTRestriction ≡∃from.(∃beforeEq.( l</p>
        <sec id="sec-3-2-1">
          <title>TConstrainti))</title>
          <p>1≤i≤m
u ∃to.(∃afterEq.( l</p>
        </sec>
        <sec id="sec-3-2-2">
          <title>TConstrainti))</title>
          <p>GeneralTRestriction plays a central role in the proposed framework, serving as
an additional restriction to be imposed on all concept definitions that require a
temporal qualification. Every TConstrainti, represented as a subset of time
intervals, is meant to express a different type of temporal constraint that is essential
for assessing whether an individual falls under a particular definition or not. A
pivotal feature of GeneralTRestriction is that its satisfiability is conditional on
the relationships between the involved time constraints. Observe, that whenever
(d1≤i≤m TConstrainti)I = ∅, i.e. when the constraints do not have a single
member common to all of them, then GeneralTRestriction is necessarily unsatisfiable,
and consequently, so are the concepts restricted by it.</p>
          <p>Recall that our goal is to confine classification only to individuals and
concepts relevant at a specific time. More specifically, it has to be assured that
given the current interval the definition of an applicable concept can be satisfied
only by the individuals that exist in that interval, and conversely, that none of
the definitions of currently inapplicable concepts are satisfiable. We obtain this
feature by incorporating two time constraints in the GeneralTRestriction of every
(time dependent) concept definition:</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>1. TConstraint1 ≡ CurrentInterval</title>
      </sec>
      <sec id="sec-3-4">
        <title>2. TConstraint2 ≡ ∃afterEq.{intervali} u ∃beforeEq.{intervalj }</title>
        <p>where intervali and intervalj , such that 1 ≤ i ≤ j ≤ n, indicate the limits of the
concept’s applicability.5 The GeneralTRestriction ensures two possible outcomes
of classification. If the current interval is contained within the period during
5 Notice, that given a total ordering of time intervals, an interpretation function maps
TConstraint2 to the subset of exactly those intervals that are placed between intervali
and intervalj (including the two) on the time axis.
which a concept is applicable (TConstraint1I ⊆ TConstraint2I ), then the potential
interpretation of the concept is limited exactly to those time-stamped individuals
that currently exist. In the opposite case, the concept is unsatisfiable with respect
to the TBox, as there is no individual that can satisfy the GeneralTRestriction.
Definitional Variants We can now use the introduced constructs to describe
definitional change. Let DynamicConcept ∈ NC be a concept whose definition
changes over time and {Variant1, . . . , Variantm} ⊆ NC its m consecutive
variants, where index k ∈ {1, . . . , m} uniquely identifies each of them. We further
assume (though it is not a general requirement), that the variants exclusively
and exhaustively cover the time axis. The definition of DynamicConcept is simply
stated as the union of all the variants:</p>
      </sec>
      <sec id="sec-3-5">
        <title>DynamicConcept ≡ Variant1 t . . . t Variantm</title>
        <p>Formally, we define every variant as an intersection of its proper meaning,
expressed in terms of some terminological restrictions and its GeneralTRestriction:</p>
      </sec>
      <sec id="sec-3-6">
        <title>Variantk ≡ Meaningk u GeneralTRestrictionk</title>
        <p>This accomplishes the representation. Observe that in each point of time
there is exactly one valid variant. Therefore, if intervali represents the current
interval and Variantk is the currently applicable variant, then interpretation of
DynamicConcept is determined by the following equality:</p>
        <p>DynamicConceptJi = VariantkJi
which naturally entails that DynamicConcept ≡ Variantk.</p>
        <p>Concluding, independently of the choice of the valid time, DynamicConcept
always denotes these and only these individuals that exist during the intervals
specified by the general temporal restriction and fall under the currently valid
meaning of DynamicConcept (see Fig. 1).
Finally, we briefly outline how the representation can be usefully applied to
express the legal notions of active and applicable concepts, and provide an
example. Informally, a legal dynamic concept can be defined as a concept where all
general temporal restrictions of the variant are scoped in at least three ways: by
the CurrentInterval, some applicability period AppInterval of a concept definition,
and the activity period ActInterval of the relevant legal text:</p>
      </sec>
      <sec id="sec-3-7">
        <title>AppInterval ≡ ∃afterEq.{intervali} u ∃beforeEq.{intervalj }</title>
      </sec>
      <sec id="sec-3-8">
        <title>ActInterval ≡ ∃afterEq.(∃from−.{norm}) u ∃beforeEq.(∃to−.{norm})</title>
        <p>where 1 ≤ i ≤ j ≤ n, and norm is the time-stamped individual representing the
respective legal text. A variant of a legal concept is valid only if the intersection
of the three constraints is nonempty.</p>
        <p>
          This kind of perspective on the life-cycle and validity of legal definitions has
been adopted in the model of the Nomic game [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The game is an illustration
of the paradox of self-amendment — a phenomenon inherent to functioning of
legal systems, where in principle, every law is potentially a subject to change,
justified by other laws effective in the system. Accordingly, every move in the
game is a change of one of its rules, some of which constitute definitions of domain
concepts. The following example shows the process of definitional change that
takes place in a hypothetical Nomic scenario.
        </p>
        <p>Example Consider a short, 10-turn long game with 3 participants, entering and
leaving the game at different stages. The participants are characterised by the
properties:6</p>
        <sec id="sec-3-8-1">
          <title>John : from(John, turn1), to(John, turn10), Male(John), Player(John)</title>
        </sec>
        <sec id="sec-3-8-2">
          <title>Ann : from(Ann, turn3), to(Ann, turn10), Female(Ann), Player(Ann)</title>
        </sec>
        <sec id="sec-3-8-3">
          <title>Mary : from(Mary, turn1), to(Mary, turn8), Female(Mary), Player(Mary)</title>
          <p>Initially, the set of rules contains the following regulation, defining the
concept of Voter.
rule 303: Until turn 4 all players shall be eligible voters. After that, until the
end of the game, only male players shall be considered as such.
6 Note that whereas DL typically adopts the Unique Name Assumption (UNA), OWL
DL does not. Intervals need therefore be distinguished using the owl:allDifferent
construct.</p>
          <p>Clearly, rule 303 constitutes two definitional variants of the concept and
explicitly states their applicability intervals. At the end of turn 6, however, the rule
is repealed and replaced by another one, taking effect immediately from turn 7,
which brings about a revision of the meaning of Voter:
rule 304: All and only female players shall be eligible voters.</p>
          <p>We describe the setting with the following set of axioms, which express
definitional variants of Voter and their applicability periods, enactment and repeal
time of rules, along with their corresponding activity periods:</p>
        </sec>
      </sec>
      <sec id="sec-3-9">
        <title>Voter1 ≡ Player u GeneralTRestriction1</title>
      </sec>
      <sec id="sec-3-10">
        <title>Voter2 ≡ Player u Male u GeneralTRestriction2</title>
      </sec>
      <sec id="sec-3-11">
        <title>Voter3 ≡ Player u Female u GeneralTRestriction3</title>
      </sec>
      <sec id="sec-3-12">
        <title>AppInterval1 ≡ ∃afterEq.{turn1} u ∃beforeEq.{turn4}</title>
      </sec>
      <sec id="sec-3-13">
        <title>AppInterval2 ≡ ∃afterEq.{turn5} u ∃beforeEq.{turn10}</title>
      </sec>
      <sec id="sec-3-14">
        <title>AppInterval3 ≡ ∃afterEq.{turn7} u ∃beforeEq.{turn10}</title>
        <p>rule 303 : from(rule 303, turn1), to(rule 303, turn6)
rule 304 : from(rule 304, turn7), to(rule 304, turn10)</p>
      </sec>
      <sec id="sec-3-15">
        <title>ActInterval303 ≡ ∃afterEq.(∃from−.{rule 303}) u ∃beforeEq.(∃to−.{rule 303})</title>
        <p>≡ ∃afterEq.{turn1} u ∃beforeEq.{turn6}
≡ ∃afterEq.{turn7} u ∃beforeEq.{turn10}</p>
      </sec>
      <sec id="sec-3-16">
        <title>ActInterval304 ≡ ∃afterEq.(∃from−.{rule 304}) u ∃beforeEq.(∃to−.{rule 304})</title>
        <p>Given all the conditions we constrain the definitional variants via the
respective general temporal restrictions with respect to the time intervals listed below,
and finally, posit the generic definition of the concept Voter:</p>
        <sec id="sec-3-16-1">
          <title>GeneralTRestriction1 : CurrentInterval, AppInterval1, ActInterval303</title>
        </sec>
        <sec id="sec-3-16-2">
          <title>GeneralTRestriction2 : CurrentInterval, AppInterval2, ActInterval303</title>
        </sec>
        <sec id="sec-3-16-3">
          <title>GeneralTRestriction3 : CurrentInterval, AppInterval3, ActInterval304</title>
        </sec>
      </sec>
      <sec id="sec-3-17">
        <title>Voter ≡ Voter1 t Voter2 t Voter3</title>
        <p>Observe, that depending on the choice of the current interval the following
interpretations of Voter, complying to the imposed limits of validity, will be inferred:
CurrentInterval Active rule Valid variant
interval1 rule303 Voter1
interval3 rule303 Voter1
interval5 rule303 Voter2
interval8 rule304 Voter3
interval10 rule304 Voter3</p>
        <p>VoterI
{John, Mary}I
{John, Ann, Mary}I</p>
        <p>{John}I
{Ann, Mary}I
{Ann}I</p>
        <p>Regardless of the varying interpretation, all domain concepts that refer to
Voter remain intact.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and Discussion</title>
      <p>In this paper we presented a representation that allows the expression of
definitional changes in ontologies, motivated predominantly by requirements from the
legal domain. It can be expressed as a set of TBox and ABox axioms in SHOIN
and is thus easily implementable in OWL-DL. The representation allows the
correct classification of individuals in an ontology using different variants of concept
definitions, applicable within specified scopes of time intervals. Furthermore, the
inherent representation of time provides a framework for capturing the basic
dynamics of the domain on the level of individuals, and for including temporal
aspects directly into the definitions of concepts. We have tested the
representation by modelling an instance of the Nomic game.</p>
      <p>The solution satisfies the basic requirements with respect to ontology
versioning formalisms and exhibits several interesting features. It is supported directly
by standard reasoning tools such as Pellet: no additional formalism nor
external ontology management system is necessary. And furthermore, a definitional
change is implemented incrementally, only by introducing new concepts to the
current ontology. No other elements, even those referring to a generic concept,
are altered. This property seems especially valuable for reuse and maintenance
of legal ontologies, taking into account the entrenchment of concepts in models
of legislation. Although the scheme is very space efficient, this is achieved at the
expense of reasoner performance when switching between versions. Whether this
trade-off is well balanced depends on the intended application. Presumably, three
factors should play a role here: the size of an ontology, the scope and frequency
of introduced changes and the frequency of version switching requests.</p>
      <p>Related to this, we investigated the use of an individual (instead of a
concept) to represent the current interval. Because OWL does not adopt the unique
name assumption, this interval can be equated with any interval by using the
owl:sameAs construct: the choice of the current interval is held outside of the
TBox. This representation seems to perform slightly better than the one based
on the use of nominals, and significantly better than an alternative using
pseudonominals.7 It may also be useful to introduce a last interval individual, equated
to the last interval on the time axis to serve as the right limit of time stamps and
scopes of all those individuals and concepts which have not in fact become
outdated. Extending the time axis in an ontology can be done by merely changing
the referent of last interval.</p>
      <p>In future research we aim to investigate in more detail the issues concerning
efficiency of reasoning over the representation, and moreover, to explore the
possibility of formulating and answering time-related queries that move beyond
7 Note, however, that so far we have not tested the approaches on large scale examples.</p>
      <p>
        On a minimal example, realisation in Pellet for nominal and pseudo nominal solutions
takes respectively 2 and 4 times longer than the solution using individuals.
mere selection of the currently valid version of an ontology (cf. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]). Extending the
formalism to a different dimension would be another interesting direction. As the
applicability of law is not only relative to time but also to location, legal concepts
could be analogously restricted with spatial constraints (cf. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]). However, the
choice of a suitable representation of space needs to be carefully considered since
the analogy between temporal and spatial aspects of legal applicability is likely
to fall short in many ways.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Baader</surname>
          </string-name>
          and
          <string-name>
            <given-names>W.</given-names>
            <surname>Nutt</surname>
          </string-name>
          .
          <source>The Description Logic Handbook: Theory</source>
          , Implementation, and Applications, chapter Basic Description Logic, pages
          <fpage>47</fpage>
          -
          <lpage>100</lpage>
          . Cambridge University Press,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Boer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hoekstra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Winkels</surname>
          </string-name>
          , T. van Engers, and
          <string-name>
            <given-names>F.</given-names>
            <surname>Willaert</surname>
          </string-name>
          . MET Alex:
          <article-title>Legislation in XML</article-title>
          . In T. Bench-Capon,
          <string-name>
            <given-names>Aspassia</given-names>
            <surname>Daskalopulu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.G.F.</given-names>
            <surname>Winkels</surname>
          </string-name>
          , editors,
          <source>Legal Knowledge and Information Systems. Jurix 2002: The th Annual Conference</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          , Amsterdam,
          <year>2002</year>
          . IOS Press.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Boer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Winkels</surname>
          </string-name>
          , T. van Engers, and E. de Maat.
          <article-title>A content management system based on an event-based model of version management information in legislation</article-title>
          . In T. Gordon, editor,
          <source>Legal Knowledge and Information Systems. Jurix</source>
          <year>2004</year>
          :
          <article-title>The 17th Annual Conference</article-title>
          ., pages
          <fpage>19</fpage>
          -
          <lpage>28</lpage>
          , Amsterdam,
          <year>2004</year>
          . IOS Press.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Eder</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Koncilia</surname>
          </string-name>
          .
          <article-title>Modelling changes in ontologies</article-title>
          .
          <source>In Proceedings of the On The Move - Federated Conferences</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Haase</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sure</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Vrandecic</surname>
          </string-name>
          .
          <article-title>Ontology management and evolution: Survey, methods and prototype</article-title>
          .
          <source>SEKT Formal Deliverable D3.1</source>
          .1, AIFB, University of Karlsruhe,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Heflin</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Hendler</surname>
          </string-name>
          .
          <article-title>Dynamic ontologies on the web</article-title>
          .
          <source>In Proceedings of the 17th National Conference on Artificial Intelligence</source>
          , pages
          <fpage>443</fpage>
          -
          <lpage>449</lpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hoekstra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Breuker</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Di Bello, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Boer</surname>
          </string-name>
          .
          <article-title>The LKIF Core ontology of basic legal concepts</article-title>
          .
          <source>In Pompeu Casanovas</source>
          , Maria Angela Biasiotti, Enrico Francesconi, and Maria Teresa Sagri, editors,
          <source>Proceedings of the Workshop on Legal Ontologies and Artificial Intelligence Techniques (LOAIT</source>
          <year>2007</year>
          ),
          <year>June 2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Natalya</given-names>
            <surname>Keberle</surname>
          </string-name>
          , Yuriy Litvinenko, Yuriy Gordeyev, and
          <string-name>
            <given-names>Vadim</given-names>
            <surname>Ermolayev</surname>
          </string-name>
          .
          <article-title>Ontology evolution analysis with owl-met</article-title>
          .
          <source>In Giorgos Flouris and Mathieu d'Aquin</source>
          , editors,
          <source>International Workshop on Ontology Dynamics (IWOD</source>
          <year>2007</year>
          ),
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Klein</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.F.</given-names>
            <surname>Noy</surname>
          </string-name>
          .
          <article-title>Ontology evolution: Not the same as schema evolution</article-title>
          .
          <source>Knowledge and Information Systems</source>
          ,
          <volume>6</volume>
          (
          <issue>4</issue>
          ):
          <fpage>428</fpage>
          -
          <lpage>440</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Peter</given-names>
            <surname>Suber</surname>
          </string-name>
          .
          <source>The Paradox of Self-Amendment. Peter Lang Publishing</source>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Radboud</surname>
            <given-names>Winkels</given-names>
          </string-name>
          , Alexander Boer, and
          <string-name>
            <given-names>Erik</given-names>
            <surname>Hupkes</surname>
          </string-name>
          . Legal Atlas:
          <article-title>Access to legal sources through maps</article-title>
          . In Radboud Winkels, editor,
          <source>Proceedings on the 11th International Conference on Artificial Intelligence and Law (ICAIL</source>
          <year>2007</year>
          ). IAAIL, ACM,
          <year>June 2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.P.</given-names>
            <surname>Zarri</surname>
          </string-name>
          .
          <article-title>Representation of temporal knowledge in events: The formalism</article-title>
          ,
          <article-title>and its potential for legal narratives</article-title>
          .
          <source>Information &amp; Communications Technology Law</source>
          ,
          <volume>7</volume>
          :
          <fpage>213</fpage>
          -
          <lpage>241</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>