<!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>Legal Interpretations in LegalRuleML</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tara Athan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guido Governatori</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Monica Palmirani</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Adrian Paschke</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Adam Wyner</string-name>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Athan Services</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>CIRSFID, University of Bologna</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Corporate Semantic Web, Freie Universität Berlin</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>NICTA Queensland</institution>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>University of Aberdeen</institution>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Legislative documents are by their own nature subject to interpretation, and interpretations of one document can diverge. In this paper we discuss the mechanism proposed by LegalRuleML to capture alternative interpretations or renderings of a legal source. LegalRuleML allows for mutually incompatible renderings (or interpretations) of a legal source to coexist in the same LegalRuleML document, and provides facilities to identify the interpretations and to select them. The mechanism is illustrated with an example form Italian Jurisprudence.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>A common trait of legal reasoning and practice is that it is often possible to have multiple
interpretations of one and the same textual provision, where there is no true interpretation.
Such alternative interpretations might be mutually incompatible. This is often the case in
legal disputes where the parties involved put forward their interpretations and where the
judge has to select one of them or propose another interpretation.</p>
      <p>
        In this paper we report on the e orts of the OASIS LegalRuleML Technical
Committee to capture the phenomenon of multiple interpretations in the LegalRuleML standard
[
        <xref ref-type="bibr" rid="ref1 ref21">21, 1</xref>
        ]. The key intuition is that an interpretation is modelled by a set of LegalRuleML
statements (e.g., rules) and a norm or textual provision can be modelled by several
alternatives where each alternative has enough metadata to determine its context and
provenance. The paper outlines LegalRuleML components and illustrates them with
examples, e.g. a real life case from Italian Jurisprudence where the topic of discussion
of the case was on di erent interpretations of a textual provision.
      </p>
      <p>
        The work on interpretation in LegalRuleML is set in the more general context of
interpretation in Linguistics in general and Forensic Linguistics in particular. In
Linguistics, issues about interpretation have long been of central concern (from [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] to [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]),
where the need for interpretation arises given that the meanings (broadly construed) of
“linguistic signs”, e.g. words, sentences, and discourses, can vary depending on
participants, context, purpose, and other parameters. Interpretation is, then, giving the meaning
of the linguistic signs for a given set of parameters. While the relationship between signs
and meaning is arbitrary in principle [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], most contemporary linguistic research has
attempted to identify principles and constraints around interpretation in order to account
for a range of consistent, widespread, and observable linguistic patterns. After all, what
is truly arbitrary can only be catalogued and not made the object of deeper scientific
scrutiny. Research e orst have focussed on syntactic ambiguity, reference, vagueness,
semantic scope, and other phenomena. It is worth noting that high performance,
statistically based, contemporary parsers (e.g. Stanford’s Dependency Parser [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]) or a parser
with associated semantic representation, (e.g. C&amp;C=Boxer [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]) do not exclude alternative
parses or semantic representations.
      </p>
      <p>
        In Forensic Linguistics, such considerations are applied to legal texts [
        <xref ref-type="bibr" rid="ref22 ref24 ref4">22, 24, 4</xref>
        ],
though with legal specific considerations. Laws prescribe behaviour, so knowing the
interpretation of a law in a context matters in terms of guiding conduct. Laws can be
challenged, thus opening presentation of alternative interpretations. Laws are composed
for social consumption, leading to issues bearing on who composed them, for what
purpose, to apply to what other parties, and so on. In addition, laws and circumstances
change over time, requiring active maintenance of interpretation. Finally, the practice of
law over time has developed its own catalogue of hermeneutical principles, a range of
techniques to interpret the law, such as catalogued and discussed in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
      </p>
      <p>LegalRuleML endeavours not to account for how di erent interpretations arise, but
to provide a mechanism to record and represent them. The main novelty of this paper
is the presentation of a formal representation of legal interpretation. In Section 2 some
of the relevant background literature is reviewed. The running example is presented
in Section 3. The case study is formalised in LegalRuleML in Section 4. The paper
concludes with Section 5.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work and OASIS LegalRuleML</title>
      <p>Norms, guidelines and rules are found in a variety of legal texts. As text, the semantic
content (including meta-data) is di cult to exchange between parties or to otherwise
process or reuse by automated applications. Yet it is essential to eGoverment and
eCommerce services that such content has a machine-readable form such that
applications can be deployed. The LegalRuleML TC, which was set up inside of OASIS
(www.oasis-open.org), aims to produce a rule interchange language for the legal
domain. Using the representation, developers can provide applications to process legal
contents for data interchange, comparison, evaluation, and reasoning.</p>
      <p>
        Over the last twenty years, the Artificial Intelligence (AI) and Law communities
have converged on modelling legal norms and guidelines using logic and other formal
techniques. With existing methods, a Legal Knowledge Engineer analyses the text,
scopes the analysis, extracts the norms and guidelines, applies models and a theory
within a logical framework, and finally represents the norms using a particular formalism.
In the last decade, several Legal XML standards have been proposed to describe legal
texts [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] with XML-based rules (RuleML, SWRL, RIF, LKIF, etc.) [
        <xref ref-type="bibr" rid="ref12 ref13">13, 12</xref>
        ]. At the
same time, the Semantic Web, in particular Legal Ontology research combined with
semantic norm extraction based on Natural Language Processing (NLP) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], has given
a strong impetus to the modelling of legal concepts [
        <xref ref-type="bibr" rid="ref2 ref5 ref6">5, 2, 6</xref>
        ]. We discuss some of these
below.
      </p>
      <p>
        Legal Knowledge Interchange Format (LKIF) is a specification that includes a
legal core ontology and a legal rule language that closely represents legal knowledge
and reasoning [
        <xref ref-type="bibr" rid="ref10 ref12 ref17">10, 17, 12</xref>
        ]. LKIF does not provide mechanisms to handle concurrent
interpretations of a legal source; more specifically, while it might be possible to represent
the content of the individual (alternative) interpretations, it is not possible to specify that
these representations are mutually exclusive.
      </p>
      <p>RuleML is a family of languages, whose modular system of schemas for XML
permits high-precision web rule interchange (http://wiki.ruleml.org/index.php/
RuleML_Home). LegalRuleML is part of this family of languages. RuleML distinguishes
deliberation from reaction rules. Deliberation rules include modal and derivation rules,
e.g. facts, queries, and Horn rules. Reaction rules include Complex Event Processing,
Knowledge Representation, Event-Condition-Action, and Production. RuleML rules can
combine derivation and reaction rules, allowing uniform XML serialization across rules.</p>
      <p>RIF (http://www.w3.org/2005/rules/wiki/RIF_Working_Group) is a W3C
recommendation for a standard Web Rule Interchange Format to exchange rule sets among
di erent rule systems. It makes use of Internationalized Resource Identifiers and supports
XML Schema data types. The RIF architecture is conceived as a family of languages. A
RIF dialect is a rule-based language with an XML syntax and a well-defined semantics.
RIF does not provide direct support for adequate representation of legal rules and legal
reasoning since they do not support e.g. logic-based negation, non-monotonic reasoning,
events and temporal metadata, among other relevant features.</p>
      <p>
        The Semantics of Business Vocabulary and Business Rules (SBVR) [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] provides
a controlled natural language [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] of fixed and finite vocabulary and syntactic form
for the expression of the terminology, facts, and rules for business documents across a
range of business activities and organisations. SBVR has an associated XML Metadata
Interchange (XMI), which supports the interchange of documents across businesses.
SBVR and LegalRuleML are closely related in that both provide XML encodings of the
semantics of terminology, facts, and rules. SBVR bears on business rules, which may
or may not have legal standing; LegalRuleML represents statements of legal standing.
LegalRuleML’s temporal notions of enforceability, e cacy, and applicability are not
provided in SBVR. LegalRuleML enables the expression of defeasibility, a rich range of
deontic concepts, and associated concepts of penalty and reparation.
      </p>
      <p>
        Given this context, the LegalRuleML Technical Committee has focused on three
specific needs [
        <xref ref-type="bibr" rid="ref1 ref21">21, 1</xref>
        ]:
1. To close the gap between natural language text description and semantic norm
modelling.
2. To provide an expressive XML standard for modelling normative rules that satisfies
legal domain requirements [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ].
3. To extend the Linked Open Data [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] approach to modelling from raw data (acts,
contracts, court files, judgements, etc.) to legal concepts and rules along with their
functionality and usage.
      </p>
      <p>The main novelty of LegalRuleML and the contribution of this paper is that it provides a
formal representation for alternative interpretations of a legal source (textual provision),
which is not found in other formal modelling languages.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Case Study</title>
      <p>
        In this section we propose a real life case (taken from the Italian legal system and
jurisprudence, originally discussed in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]) depending on multiple (alternative) interpretation
of a norm, and we show possible formalisations of the case and the interpretations. In
the next section we are going to use the formal representations developed in this section
to illustrate the LegalRuleML mechanisms to cope with the phenomenon of multiple
interpretations. The case is based on a dispute of Art. 1, Comma 2, Law 379/1990. The
article recites
      </p>
      <p>The benefit referred to in comma 1 shall be paid in an amount equal 80 per
cent of five-twelfths of the income earned and reported for tax purposes by the
freelancer in the second year preceding the year of application.1
The case 18/96, Bologna Tribunal, Imola Section, concerns the interpretation of the
conjunction in the income earned and reported for tax purposes. . . .</p>
      <p>A fundamental and unalienable principle of legal language is its close connection
with natural language; in particular, the interpretation of a textual provision should be the
ordinary meaning conveyed by the text of the provision taking into account its context in
the act in which it appears and the purpose or object underlying the act. For example,
in the Italian legal systems this connection is prescribed by Article 12 of the Preleggi,
Italian Civil Code, stating</p>
      <p>In applying a statute, the interpreter should not attribute to it a meaning di
erent from that made evident by the proper meaning of the words and by their
connection, as well as by the intention of the law maker.2
Accordingly, the literal interpretation of the norm is given by the rule</p>
      <p>earned(x; y 2) ^ reported(x; y 2) ) fOBLbaeuaxirleira=rye=mfpreloeylaenrcer g paybenefit( f (x); y) (1)
The arguments of the predicates earned and reported are the income x earned/reported
in the year in the second argument (y 2). Similarly for paybenefit where the function f
encodes the computation of the value of the benefit based on the value of the income x.
However, according to the Italian taxation legislation in force at the time of the dispute
the income received in one year is reported for tax purpose the year after the year it has
1 L’indennità di cui al comma 1 viene corrisposta in misura pari all’80 per cento di cinque
dodicesimi del reddito percepito e denunciato ai fini fiscali dalla libera professionista nel
secondo anno precedente a quello della domanda.
2 Nell’applicare la legge non si può ad essa attribuire altro senso che quello fatto palese dal
significato proprio delle parole secondo la connessione di esse, e dalla intenzione del legislatore.
earned(x; y) ! reported(x; y + 1)
reported(x; y) ! earned(x; y
1)
Consider now the Income constant obtained by applying the Russell’s definite description
operator ( ) on the conjunction in the left-hand side of (1).</p>
      <p>Income = x (earned(x; y) ^ reported(x; y))
been earned. Thus, for example, the income earned in 1995 is reported in 1996. This
principle can be formulated as follows:
(2)
(3)
(4)
(5)
(6)
The conclusion is that the constant Income is not denoting, i.e., the interpretation of
Income is ;, thus there is no income “entity” that is earned and reported in one and the
same year. Hence, the left hand side of the rule in (1) never holds, and the rule never
fires, against the intentions of the legislator.</p>
      <p>Based on the textual provision two possible interpretations are possible: in the
first interpretation the temporal expression “in the second year preceding the year of
application” refers to the income earned in the second year preceding the application,
while in the second interpretation it refers to the income reported for tax purposed
in the second year preceding the application. For example, for an application in year
1998, the first interpretation bases the computation on the income earned in 1996 (and
reported in 1997), while for the second interpretation, the value of the benefit is computed
starting from the income reported in 1996 (and earned in 1995). Accordingly, the first
interpretation, the interpretation proposed by the freelancer in the case, can be formalised
by the rule
earned(x; y
2) )</p>
      <p>fOBLbaeuaxirleira=rye=mfpreloeylaenrcer g paybenefit( f (x); y)
Similarly the second interpretation, the interpretation proposed by the employer, can be
represented by the rule3
reported(x; y
2) )</p>
      <p>fOBLbaeuaxirleira=rye=mfpreloeylaenrcer g paybenefit( f (x); y)
The task of the Judge was to decide which of the two interpretations has to be used for
the application of the norm. In the case the Judge argue in favour of the interpretation
advanced by the freelancer.
4</p>
    </sec>
    <sec id="sec-4">
      <title>LegalRuleML Representation of the Case Study</title>
      <p>In the previous section we presented three possible interpretations of the norm, the
literal interpretation, the interpretation of the freelancer and the interpretation of the
3 Alternatively, we could use earned(x; y</p>
      <p>3) )
while, from a formal point of view, it is semantically equivalent to (6) it is less close in meaning
to the textual provision than its counterpart: the temporal reference in the argument would
“third year preceding the year of the application”.</p>
      <p>OBLbaeuaxirleira=rye=mfpreloeylaenrcer paybenefit( f (x)),
employer. Here we are going to present the LegalRuleML fragments required to
encode the formalisations corresponding to the three interpretations. The formalisations
of these three statements can be represented as prescriptive rules which are encoded
by &lt;lrml:PrescriptiveStatement&gt; blocks in LegalRuleML, each containing one
&lt;ruleml:Rule&gt; Template. The following fragment corresponds to the literal
interpretation, i.e., (1)
Since LegalRuleML is built on top of RuleML we can reuse all RuleML facilities, in
particular we can use &lt;ruleml:Expr&gt; and &lt;ruleml:Fun&gt; to encode the computation of
the benefit to be paid to the freelancer.</p>
      <p>The next snippet captures the interpretation of the freelancer, i.e., (5).
&lt;lrml:PrescriptiveStatement key="freelancer"&gt;
&lt;ruleml:Rule closure="universal" key=":freelancer-template"&gt;
&lt;ruleml:if&gt;</p>
      <p>&lt;ruleml:Atom keyref=":atom-earned"/&gt;
&lt;/ruleml:if&gt;
&lt;ruleml:then&gt;</p>
      <p>&lt;lrml:Obligation keyref="#obl-paybenefit"/&gt;
&lt;/ruleml:then&gt;
&lt;/ruleml:Rule&gt;
&lt;/lrml:PrescriptiveStatement&gt;
Notice that inside this statement we can use keyrefs to refer to the elements already
defined in the block corresponding to the literal interpretation. Similar considerations
apply to the block modelling (6), the employer’s interpretation, below.
&lt;lrml:PrescriptiveStatement key="employer"&gt;
&lt;ruleml:Rule closure="universal" key=":employer-template"&gt;
&lt;ruleml:if&gt;</p>
      <p>&lt;ruleml:Atom keyref=":atom-reported"/&gt;
&lt;/ruleml:if&gt;
&lt;ruleml:then&gt;</p>
      <p>&lt;lrml:Obligation keyref="#obl-paybenefit"/&gt;
&lt;/ruleml:then&gt;
&lt;/ruleml:Rule&gt;
&lt;/lrml:PrescriptiveStatement&gt;
The following LegalRuleML Constitutive Statement represents the principle expressed
in (2), that earned income will be reported in the following year. Because a Constitutive
Statement defines concepts and does not prescribe behaviours, the consequent of its
&lt;ruleml:Rule&gt; Template does not contain deontic operators.
Similarly, the following fragment represents the principle that reported income was
earned in the previous year, as expressed in (3).
After the renderings of the alternative interpretations and the relationships between the
predicates earned and reported given by the three constitutive rules, we have to specify
that they are mutually exclusive formalisation of the same norm. This can be achieved by
following Alternatives block that represents a mutually-exclusive collection of renderings
of the Legal Norms from the Legal Source #ls1. The &lt;lrml:LegalSource&gt; with key
#ls1, not shown in the text, contains the references to the actual text of the norm.
&lt;lrml:Alternatives key="maternity-alts"&gt;
&lt;lrml:Comment&gt; These alternatives are mutually</p>
      <p>incompatible formalizations of the same legal source: keyref="#ls1".
&lt;/lrml:Comment&gt;
&lt;lrml:hasAlternative keyref="#literal" /&gt;
&lt;lrml:hasAlternative keyref="#freelancer" /&gt;
&lt;lrml:hasAlternative keyref="#employer" /&gt;
&lt;/lrml:Alternatives&gt;
A &lt;lrml:Context&gt; block is used to render a collection of Associations, e.g. the
Association of a Legal Source with a rendering of it as a LegalRuleML Statement, or to
constrain other Contexts with respect to Alternatives. The following Context establishes
a constraint that at most one of the Alternatives from the collection #maternity-alts
may be selected by each Context:
&lt;lrml:Context key="maternity-alts-ctxt"&gt;
&lt;lrml:appliesAssociations keyref="#asn-alts"/&gt;
&lt;lrml:appliesAlternatives keyref="#maternity-alts"/&gt;
&lt;/lrml:Context&gt;
The Context metadata, e.g. authorship, source, authority, temporal and jurisdictional
properties, are specified in an external (to the Context) Association block with identifier
asn-alts, not shown in the paper, which is referenced using keyref. Similarly other
Context blocks (also not shown in the paper) are given with the metadata about the
authors of the various Statements. This permits to establish the provenance of the
interpretations.</p>
      <p>In the following fragment, a particular Alternative – that proposed by the freelancer –
is selected, leading to the generation of the corresponding &lt;ruleml:Rule&gt; from the rule
Template :freelancer-template.
&lt;lrml:Context key="adjudication"&gt;
&lt;lrml:appliesAssociation keyref="#asn-adjudication"/&gt;
&lt;lrml:inScope keyref="#freelancer"/&gt;
&lt;/lrml:Context&gt;
Unlike the first Context block, this one contains an &lt;lrml:inScope&gt; element. Such
Contexts render interpretations that select one or more Statements as their scope of
interpretation. When a Context is processed for presentation or inference, Legal Rules4
are generated from the &lt;ruleml:Rule&gt; Templates of in-scope Statements, annotated and
optionally modified semantically by the Associations of the Context.</p>
      <p>In this example the external Association asn-adjudication links the metadata
for the adjudication of the case with a particular rendering of the norm, the
rendering freelancer, corresponding to the interpretation proposed by the freelancer and
confirmed by the judge5.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>In this paper, we presented the mechanisms for the representation of (mutually
incompatible) alternative interpretations of legal sources (textual provisions) in a LegalRuleML
document. Specifically, we introduced the &lt;lrml:Alternatives&gt; element that is to be
used to specify alternative formal renderings of a legal source, where the alternatives in a
block are mutually exclusive. The key idea is that each rendering corresponds to an
interpretation of the legal source. Using &lt;lrml:Alternatives&gt; along with &lt;lrml:Context&gt;
blocks, we can specify the di erent formal renderings of a legal source and their
metadata that associates them with other elements in a LegalRuleML document, e.g. the
interpreter of the legal sources, the time of such interpretations, and the context where
4 In this paper, we focus on Prescriptive and Constitutive Statements, which always lead to
generated Legal Rules. However, in the general case, e.g. &lt;lrml:FactualStatement&gt;, something
other than a Legal Rule may be generated when a Statement is in scope.
5 The full example is available from https://tools.oasis-open.org/version-control/
browse/wsvn/legalruleml/trunk/examples/approved/maternity_alternatives_
compact.lrml
such interpretations apply. Furthermore, we presented a real life case that illustrates
how to use &lt;lrml:Alternatives&gt; to model the di erent interpretations of an
ambiguous legal source such as arise in a legal dispute. An important advantage of the use
of &lt;lrml:Alternatives&gt; is that it reduces redundancies in encoding the formalisation
of a legal document. Di erent interpretations of a legal document can occur for many
reasons (e.g., di erent readings of one norm by the parties involved in a legal dispute,
di erent granularity of representation required by di erent applications, di erent
interpretations with respect di erent (sub-)jurisdictions, the change of interpretation of
terms over time, . . . ). The mechanism we have proposed does not force the author of
a LegalRuleML document to duplicate and modify the document just to accommodate
every di erent interpretation of a legal source. All the author has to do is to create
an &lt;lrml:Alternatives&gt; block in a single LegalRuleML document, add the various
alternatives in the block, and refer to it from &lt;lrml:Context&gt; blocks that associate
metadata with sets of statements. Then by filtering with respect to the metadata associated
with an alternative, one can generate the manifestation of the document
corresponding to alternative interpretations selected by the filtering conditions, employing the
&lt;lrml:Alternatives&gt; expression to ensure that mutually incompatible alternatives are
not simultaneously asserted in the same context.</p>
      <p>The LegalRuleML syntax for the metadata collections, e.g. Alternatives,
Jurisdictions, LegalSources, was designed to facilitate the exposure of these relationships as
Linked Open Data (LOD). The RDF Collection structure is particularly appropriate for
this, because it can be closed, indicating that the collection contains only the entities
explicitly asserted to belong to it. An XSLT transformation will be developed to convert
the LegalRuleML XML into RDF, while an RDFS metamodel will capture additional
constraints. We envision that the major benefits of the RDF representation of
LegalRuleML are the possibility to integrate the legal knowledge with information stored
in other Open Data repositories and triple stores, and the ability to use tools such as
SPARQL reasoners for preprocessing LegalRuleML documents before passing data to
specialised legal reasoners.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>T.</given-names>
            <surname>Athan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Boley</surname>
          </string-name>
          , G. Governatori,
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmirani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Paschke</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Wyner</surname>
          </string-name>
          .
          <article-title>OASIS LegalRuleML</article-title>
          .
          <source>In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law (ICAIL</source>
          <year>2013</year>
          ), pages
          <fpage>3</fpage>
          -
          <lpage>12</lpage>
          . ACM,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>V. R.</given-names>
            <surname>Benjamins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Casanovas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Breuker</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Gangemi, editors.
          <source>Law and the Semantic Web: Legal Ontologies, Methodologies, Legal Information Retrieval and Applications</source>
          . Springer,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Berners-Lee. Long live the web: A call for continued open standards and neutrality</article-title>
          .
          <source>Scientific American</source>
          , (
          <issue>22 November)</issue>
          :
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>B. H.</given-names>
            <surname>Bix</surname>
          </string-name>
          .
          <article-title>Legal interpretation and the philosophy of language</article-title>
          . In P. Tiersma and L. Solan, editors,
          <source>The Oxford Handbook of Language and Law</source>
          , pages
          <fpage>145</fpage>
          -
          <lpage>155</lpage>
          . Oxford,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>A.</given-names>
            <surname>Boer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Winkels</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Vitali</surname>
          </string-name>
          .
          <article-title>Metalex XML and the legal knowledge interchange format</article-title>
          . In P. Casanovas, G. Sartor,
          <string-name>
            <given-names>N.</given-names>
            <surname>Casellas</surname>
          </string-name>
          , and R. Rubino, editors,
          <source>Computable Models of the Law, Languages</source>
          , Dialogues, Games, Ontologies, volume
          <volume>4884</volume>
          <source>of LNCSe</source>
          , pages
          <fpage>21</fpage>
          -
          <lpage>41</lpage>
          . Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>J.</given-names>
            <surname>Breuker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Boer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hoekstra</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          K. van den Berg.
          <article-title>Developing content for lkif: Ontologies and frameworks for legal reasoning</article-title>
          . In T. M. van Engers, editor,
          <source>JURIX 2006</source>
          , pages
          <fpage>169</fpage>
          -
          <lpage>174</lpage>
          . IOS Press,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Curran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Clark</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Bos</surname>
          </string-name>
          .
          <article-title>Linguistically motivated large-scale NLP with C&amp;C and Boxer</article-title>
          .
          <source>In ACL. The Association for Computer Linguistics</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>M.-C. de Marne e</surname>
            , B. MacCartney, and
            <given-names>C. D.</given-names>
          </string-name>
          <string-name>
            <surname>Manning</surname>
          </string-name>
          .
          <article-title>Generating typed dependency parses from phrase structure parses</article-title>
          .
          <source>In IN PROC. INT'L CONF</source>
          .
          <article-title>ON LANGUAGE RESOURCES AND EVALUATION (LREC</article-title>
          , pages
          <fpage>449</fpage>
          -
          <lpage>454</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9. F. de Saussure. Cours de Linguistique Générale. Payot, Lausanne and Paris,
          <year>1916</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>Estrella</given-names>
            <surname>Project</surname>
          </string-name>
          .
          <article-title>The legal knowledge interchange format (LKIF)</article-title>
          .
          <source>Technical report, ESTRELLA Project</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. E. Francesconi,
          <string-name>
            <given-names>S.</given-names>
            <surname>Montemagni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Peters</surname>
          </string-name>
          , and D. Tiscornia, editors.
          <source>Semantic Processing of Legal Texts: Where the Language of Law Meets the Law of Language</source>
          , volume
          <volume>6036</volume>
          <source>of LNCS</source>
          . Springer,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>T. F.</given-names>
            <surname>Gordon</surname>
          </string-name>
          .
          <article-title>Constructing legal arguments with rules in the legal knowledge interchange format (LKIF)</article-title>
          . In P. Casanovas,
          <string-name>
            <given-names>N.</given-names>
            <surname>Casellas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Rubino</surname>
          </string-name>
          , and G. Sartor, editors,
          <source>Computable Models of the Law, number 4884 in LNCS</source>
          , pages
          <fpage>162</fpage>
          -
          <lpage>184</lpage>
          . Springer Verlag,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>T. F. Gordon</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Governatori, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Rotolo</surname>
          </string-name>
          .
          <article-title>Rules and norms: Requirements for rule interchange languages in the legal domain</article-title>
          . In G. Governatori,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hall</surname>
          </string-name>
          , and
          <string-name>
            <surname>A</surname>
          </string-name>
          . Paschke, editors,
          <source>RuleML</source>
          , volume
          <volume>5858</volume>
          <source>of LNCS</source>
          , pages
          <fpage>282</fpage>
          -
          <lpage>296</lpage>
          . Springer,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. G. Governatori.
          <article-title>Un modello formale per il ragionamento giuridico</article-title>
          .
          <source>PhD thesis</source>
          , CIRFID, Università di Bologna,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Rotolo</surname>
          </string-name>
          .
          <article-title>Norm compliance in business process modeling</article-title>
          . In M.
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rotolo</surname>
          </string-name>
          , and S. Tabet, editors,
          <source>RuleML</source>
          , volume
          <volume>6403</volume>
          <source>of LNCS</source>
          , pages
          <fpage>194</fpage>
          -
          <lpage>209</lpage>
          . Springer,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>B. N.</given-names>
            <surname>Grosof</surname>
          </string-name>
          .
          <article-title>Representing e-commerce rules via situated courteous logic programs in RuleML</article-title>
          .
          <source>Electronic Commerce Research and Applications</source>
          ,
          <volume>3</volume>
          (
          <issue>1</issue>
          ):
          <fpage>2</fpage>
          -
          <lpage>20</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <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>
            <given-names>M. D.</given-names>
            <surname>Bello</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Boer</surname>
          </string-name>
          .
          <article-title>LKIF core: Principled ontology development for the legal domain</article-title>
          .
          <source>In Law, Ontologies and the Semantic Web</source>
          , pages
          <fpage>21</fpage>
          -
          <lpage>52</lpage>
          , Amsterdam, The Netherlands,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. S. Lappin, editor.
          <source>The Handbook of Contemporary Semantic Theory. Blackwell Publishers</source>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>C. Lupo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Vitali</surname>
            , E. Francesconi,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Palmirani</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Winkels</surname>
            , E. de Maat,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Boer</surname>
            , and
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mascellani</surname>
          </string-name>
          .
          <article-title>General XML format(s) for legal sources -</article-title>
          <source>Estrella European Project IST2004-027655. Technical report</source>
          , Faculty of Law, University of Amsterdam, Amsterdam, The Netherlands,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. OMG.
          <article-title>Semantics of Business Vocabulary and Business Rules (SBVR)</article-title>
          .
          <source>formal specification, v1.0. Technical report</source>
          , The Object Management Group,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>M. Palmirani</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rotolo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Tabet</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Boley</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A. Paschke.</surname>
          </string-name>
          <article-title>LegalRuleML: XML-based rules and norms</article-title>
          .
          <source>In Rule-Based Modeling and Computing on the Semantic Web (RuleML</source>
          <year>2011</year>
          ), pages
          <fpage>298</fpage>
          -
          <lpage>312</lpage>
          . Springer Berlin Heidelberg,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <given-names>R.</given-names>
            <surname>Poscher</surname>
          </string-name>
          .
          <article-title>Ambiguity and vagueness in legal interpretation</article-title>
          . In P. Tiersma and L. Solan, editors,
          <source>The Oxford Handbook of Language and Law</source>
          , pages
          <fpage>128</fpage>
          -
          <lpage>144</lpage>
          . Oxford,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>A.</given-names>
            <surname>Scalia</surname>
          </string-name>
          and
          <string-name>
            <given-names>B. A.</given-names>
            <surname>Garner</surname>
          </string-name>
          . Reading Law:
          <article-title>The Interpretation of Legal Texts</article-title>
          . West,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Solan</surname>
          </string-name>
          .
          <article-title>Linguistic issues in statutory interpretation</article-title>
          . In P. Tiersma and L. Solan, editors,
          <source>The Oxford Handbook of Language and Law</source>
          , pages
          <fpage>87</fpage>
          -
          <lpage>99</lpage>
          . Oxford,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <given-names>A.</given-names>
            <surname>Wyner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Angelov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Barzdins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Damljanovic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Davis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Fuchs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hoefler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kaljurand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kuhn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Luts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pool</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rosner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Schwitter</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Sowa</surname>
          </string-name>
          .
          <article-title>On controlled natural languages: properties and prospects</article-title>
          .
          <source>In Proceedings of the 2009 conference on Controlled natural language</source>
          ,
          <source>CNL'09</source>
          , pages
          <fpage>281</fpage>
          -
          <lpage>289</lpage>
          , Berlin, Heidelberg,
          <year>2010</year>
          . SpringerVerlag.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>