<!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>SmaRT Visualisation of Legal Rules for Compliance</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Selja Seppala</string-name>
          <email>selja.seppala@ucc.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marcello Ceci?</string-name>
          <email>marcello.ceci@ucc.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hai Huang</string-name>
          <email>hai.huang@ucc.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leona O'Brien</string-name>
          <email>leona.obrien@ucc.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tom Butler</string-name>
          <email>tbutler@ucc.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Governance, Risk, and Compliance Technology Center University College Cork 13 South Mall</institution>
          ,
          <addr-line>Cork</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <fpage>73</fpage>
      <lpage>85</lpage>
      <abstract>
        <p>This paper presents a visualization technique to assist legal experts in formalising their interpretation of legal texts in terms of regulatory requirements. (Semi-)automation of compliance processes requires a machine-readable version of legal requirements in a format that enables e ective compliance assessment. The use of a semi-structured controlled natural language as an intermediate step of the translation from a human-readable text to a machine-readable and understandable format ensures that the process of interpretation of those requirements is as simple as possible. However, it does not ensure that the formal representation resulting from the interpretation faithfully represents the intended semantics provided by the legal expert. Visualization techniques such as property graphs in Neo4j could ll this gap, allowing legal experts to understand and control the formal representation of the result of their act of interpretation.</p>
      </abstract>
      <kwd-group>
        <kwd>SBVR</kwd>
        <kwd>RegTech</kwd>
        <kwd>Controlled Natural Languages</kwd>
        <kwd>Neo4j</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Ensuring compliance with regulatory requirements represents a considerable
challenge for industries that deal with large amounts of data across di erent
jurisdictions. This is particularly true for safety-critical industries such as the
international nancial industry, driven by the proliferation and complexity of
the nancial regulatory environment in the aftermath of the global nancial
crisis. The wide acceptance in the industry that traditional Governance, Risk, and
Compliance (GRC) information systems are in de cit is leading to a growing
interest in semantic technologies as a solution [
        <xref ref-type="bibr" rid="ref1 ref4">1, 4</xref>
        ]. By using such technologies,
compliance of companies' business policies and processes { and even of their
activities represented by company data { could be assessed automatically. Even
before achieving such an integration, exploration of the regulatory space could
be performed in a very e ective way, e.g., by querying the relevant regulatory
? Corresponding author.
knowledge base to quickly retrieve all relevant obligations for a certain business
activity.
      </p>
      <p>
        One of the problems with representing the interpretation of legal rules in
a machine-readable format lies in the lack of understanding and control of the
formal models by legal experts. Some research approaches [
        <xref ref-type="bibr" rid="ref10 ref13 ref17 ref9">9, 17, 10, 13</xref>
        ] rely on
formal representations of rules that, despite being very expressive and thus
allowing powerful inference, are not provided in a format that is understandable
and manageable by a legal expert. To overcome this, other approaches [
        <xref ref-type="bibr" rid="ref12 ref16">16, 12</xref>
        ]
suggest the use of controlled natural languages to translate the semantics of a
legal text into a machine-readable representation. Similarly, our approach aims
to de ne a controlled natural language that has complete coverage of the
relevant legal e ects of requirements while at the same time constraining the natural
language as little as possible.
      </p>
      <p>The research behind the present paper follows an approach that allows
legal experts to interpret a legal statement by rewriting it in a semi-structured
controlled natural language using a dedicated software called SmaRT. The core
translation process relies on the markup and annotation of strings in the
rewritten text in terms of given vocabulary elements. However, this is not su cient to
put legal experts in control of all the elements that compose the logical
formulation of the legal rule. The paper thus presents a possible solution that relies on
property graphs to visualize the interpreted rule and all the relevant elements
in a format that a lawyer can understand and manipulate. This should allow to
ensure that the human-readable text and the machine-readable output of a legal
rule carry the same semantics, thus achieving a semi-automatic translation of
legal requirements for compliance purposes.</p>
      <p>The rest of the paper is structured as follows. In the next section, we
introduce the Regulatory Interpretation Methodology (RIM) and the controlled
natural language. In Section 3, we look into relevant details of the RIM and the
rule-editing tool SmaRT to understand the visualisation needs for the rule
interpretation task. In Section 4, we present a possible visualisation solution that
addresses these needs.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The Regulatory Interpretation Methodology</title>
      <p>
        Understanding regulations is a complex task and legal experts face a number of
challenges in interpreting a regulatory text, including: following and eshing out
references and citations; identifying, delimiting, and disambiguating de nitions;
making sense of complex sentences; clarifying ambiguities resulting from legalese;
accounting for exceptions [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Our research aims to bridge the gap between the
legal expertise required to interpret the regulatory text and the modelling skills
required to build a semantic knowledge base. The goal is to foster compliance
in the nancial sector by supporting corporate lawyers, risk practitioners and
compliance professionals in their role of subject matter experts in making law
more readily consumable and comprehensible by the industry.
      </p>
      <p>
        The translation of regulatory text into machine-readable information is
articulated around a methodology that de nes a process for transforming a regulatory
text into a formal representation using an intermediate human-readable
representation in semi-structured English. The process (see Fig. 1) is designed as a
collaborative one, involving the legal expert as a subject matter expert (SME)
and the modeller as a semantic technology expert (STE) through multiple
iterations [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>
        The solution allows SMEs to represent the semantics of regulatory
requirements in a machine-readable format through a SME-friendly process. This is
ensured through the use of SBVR (Semantic of Business Vocabularies and Business
Rules), a Object Management Group speci cation based on formal logics and
well known to the industry [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. In SBVR, a requirement is rewritten in
Structured English, a semi-structured controlled natural language where every term
used in the rules is sourced and speci ed in a terminological dictionary. SBVR is
a powerful instrument for modelling an area of business activity and for building
a business vocabulary [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], but it is not suitable { as is { for the representation of
legal rules; some SBVR components are not needed or overcomplicate the task
of rule representation (e.g. the logical formulation of a sentence, see [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]), and
some components fall short in capturing legal concepts (e.g. constitutive rules).
      </p>
      <p>
        To overcome this, our research group at the Governance, Risk, and
Compliance Technology Center (GRCTC) has devised a resource called Mercury,
composed of:
{ Mercury-SE, a semi-structured English based on SBVR used as an
intermediate language between the legal text and the machine-readable format,
and
{ Mercury-ML, a persistence model in RDF format, capturing the semantics
of Mercury-SE in a machine-readable format.
Mercury represents rule statements contained in regulations and describes the
concepts used in those rules in a vocabulary. The process of translation from the
legal text to the Mercury-SE language is manual and tool-assisted. The software,
SmaRT, is speci cally designed to make the translation process as intuitive as
possible, while at the same time reducing the user's time devoted to the most
repetitive work. The reader is invited to refer to [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] for more details on SBVR,
Mercury, and the ways in which the latter enhances the former.
      </p>
      <p>
        Mercury relies on both (a) technologies from the Semantic Web (SW) stack
at the RDF layer and (b) non-SW technologies (SBVR and the RIM). It relies on
upper SW layers, particularly OWL, for advanced classi cation and reasoning
on rules and vocabulary. The GRCTC is currently developing a set of
ontologies called FIRO (Financial Industry Regulatory Ontology) to enable semantic
applications such as classi cation, querying, and reasoning, and has devised a
mapping of all SBVR elements relevant to Mercury into RDF/OWL to assist
the STE in translating Mercury rulebooks and vocabularies [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Because of limitation of OWL and Description Logics [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], FIRO does not
involve complete rule-based reasoning but only rule representation. The aim is
to capture relevant information on the regulatory requirements and to be able
to:
{ run queries on the resulting RDF/OWL knowledge base;
{ perform abstract classi cation and reasoning on rules and their regulated
actions (e.g., detecting which rules regulate a subset of another rule's regulated
action);
{ validate data representing instances of regulated actions (events) as
compliant or breaching one or more rules.
      </p>
      <p>In order to perform these tasks, we need the legal rules { represented in
Mercury-ML { to be complete in terms of semantics and computable. Mercury
being a semi-structured controlled natural language, there is a need for solutions
that allow SMEs to have greater control over the formal representation of their
interpretation of a legal rule without having to learn any speci c formalism. We
propose to achieve this by providing a graphical solution that allows the SMEs
to visualise rules in a more schematic way. For example, Fig. 2 shows a graphical
representation of the following rule:
Rule 1. It is obligatory that a market operator that operates a trading venue
makes public credits and debts.</p>
      <p>The graph in Fig. 2 makes explicit the information about the logical
formulation of the rule that is not immediately apparent in the textual form. For
example, it shows that market operator is the subject of three verb concepts:
market operator operates trading venue, market operator makes public credit, and
market operator makes public debt. It also shows which verb concepts express
the deontic condition of the rule { see the dashed box in red { distinguishing it
from the other verb concept, which expresses the rule's applicability condition.
Finally, it shows how the former and the latter verb concepts relate to each other
{ they are connected via the same subject, market operator.</p>
      <p>In the next section, we describe the tasks of the Regulatory Interpretation
Methodology in more detail to specify further our visualization needs.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Visualisation Needs</title>
      <p>
        To create a rule from a legal document, SMEs follow the methodology de ned
in the RIM. First, they identify a unit of analysis within a given legal document.
Second, they rewrite the text of the unit of analysis, eshing out references.
Third, they identify and de ne the noun concepts (i.e., entities) and verb
concepts (i.e., actions with their participants and other attributes) and mark the
keywords (e.g., the logical operators) composing the rule. Finally, they specify
the logical formulation of the rule by linking verb concepts to each other. This
logical formulation follows speci c patterns for constitutive rules [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and more
generic ones for regulative rules [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Here, we focus on the third and fourth steps
and, more speci cally, on the subtasks of (i) creating verb concepts within a rule
and (ii) linking verb concepts to each other to form rules.
      </p>
      <p>All these steps are carried out using SmaRT, our web-based rule editing tool.
Fig. 3 shows the editor window at the rst step of the methodology. The original
regulatory text is displayed in the upper box and the text rewritten by the SME
is displayed in the lower box.
3.1</p>
      <sec id="sec-3-1">
        <title>Visualising Noun Concepts and their Links to Verbs</title>
        <p>The task of creating verb concepts consists of identifying all the noun concepts
{ usually domain-speci c terms { and linking them to the appropriate verbs or
verb phrases using one of the roles that specify the semantic relation between a
noun concept and the action denoted by the verb, such as hasSubject, hasObject,
hasIndirectObject, and hasLocation. A verb concept is created when all the
relevant noun concepts are linked to the verb concept's verb with one (and only one)
of these relations. The verb of a verb concept should be captured in its active
form and should account for any of its variant forms, e.g., its passive form.
Therefore, the rst visualisation requirement to assist the SMEs in the task
of creating verb concepts is to display (i) the building blocks of a verb concept {
the verb and the noun concepts { and (ii) the links representing the roles relating
noun concepts to the verb in a verb concept.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Visualising Verb Concepts and their Links to Each Other</title>
        <p>The second task of connecting verb concepts to each other to form the rules
brings about further requirements for useful visualisation aids. This task consists
of two subtasks:
{ Identifying the logical operators (and /or ) forming a conjunction or
disjunction of two or more noun concepts that play the same role with respect to
a verb concept. This results in the creation of two or more verb concepts
denoting two or more actions with their participants and other attributes
(see Fig. 4).
{ Identifying noun concepts that play a role in more than one verb concept
(see Fig. 5).</p>
        <p>Therefore, the second visualisation requirement to assist the SMEs in the
task of linking verb concepts to each other is to display these larger building
blocks and their links in a user-friendly manner that captures and gives a clear
understanding of the logical structure of a rule (see Fig. 6).
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Limitations of the Current Visualisation Capabilities</title>
        <p>To help the SMEs in these tasks, the current version of SmaRT integrates display
functions that address only part of the visualisation needs. The tool allows SMEs
to visualise the di erent elements of a verb concept as shown in Fig. 7. These are
displayed using color-coded tags that encapsulate the respective text spans using
distinct colors for noun concepts (in green) and verbs { verb parts of speech and
verbal phrases { (in blue).</p>
        <p>Selecting a verb highlights the entire verb concept, that is, the verb and the
related noun concepts. This is illustrated in Fig. 8, where the verb operates in
the verb concept market operator operates trading venue is marked in blue and
the related noun concepts, market operator and trading venue, in red. However,
the current solution is limited in that the roles played by each noun concept
within a verb concept are not graphically represented in the main window. They
are speci ed and displayed in a separate pane (see the text box on the right-hand
side of the editor in Fig. 8).</p>
        <p>Similarly, the current implementation does not support the visualisation of
more complex relations between verb concepts resulting from conjunctions or
disjunctions of noun concepts { \make public credits AND debts", nor of how
two or more verb concepts are linked to each other { market operator is the
subject of makes public and of operates and thus links the corresponding verb
concepts.</p>
        <p>In sum, the visualisation needs for a seamless execution of these tasks can be
broadly categorized into two types: grouping textual spans at di erent levels of
granularity and linking these spans to each other in a user-friendly manner that
clari es and makes the logical structure of a rule explicit. Ideally, the rule-editing
tool would allow the SMEs not only to visualise the rules, but also to interact
with the visual environment to build the rules. Finally, the visualisation
solution should also address end-user needs by providing them with additional query
functions that would allow them to retrieve and display relevant rules for
enhanced regulatory compliance veri cation. To address the current shortcomings
of the tool and improve its user-friendliness, we have explored a visualisation
solution that would meet these needs and assist the SMEs in the rule-editing
task.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Graphical Representation of Legal Rules</title>
      <p>Graphs are helpful to visualise relationships. In this section, we present a method
to represent vocabularies and legal rules in property graphs and store them in
the graph database management system Neo4j1 that allows for native graph
storage and processing. The property graph contains connected entities (the
nodes) which can hold any number of attributes (key-value pairs). Nodes can be
tagged with labels representing their di erent roles in a domain. In addition to
contextualizing node and relationship properties, labels may also serve to attach
meta data, index, or constraint information to certain nodes.</p>
      <p>Neo4j uses Cypher2, a declarative, SQL-inspired language for visually
describing patterns in graphs using an ascii-art syntax. Here, Cypher is used to
represent and query graph data.
4.1</p>
      <sec id="sec-4-1">
        <title>Graphical Representation of Noun and Verb Concepts</title>
        <p>Graphical Representation of Noun Concepts. Noun concepts constitute
building blocks of legal rules; they can be nancial concepts. Each noun concept
includes attributes, such as label, concept type, context type, and their
corresponding values. They also include object properties such as hasGeneralConcept, which
indicates a subclass relationship between two noun concepts. We represent each
noun concept as a graph node, with key-value pairs specifying its attributes and
their corresponding values.</p>
        <p>Fig. 9 shows an example of a noun concept, investment rm, with some
of its attributes and corresponding values (shown in the bottom bar), and a
relationship hasGeneralConcept between investment rm and the noun concept
company, indicating that the concept investment rm is a subclass of the concept
company.</p>
        <p>Graphical Representation of Verb Concepts. Usually, verb concepts
denote actions contained in rules and describe basic relationships between noun
concepts. Each verb concept includes a subject and a verb or verbal phrase called
verbSymbol. It may also include an object, and indirect object or other types of
relations such as hasLocation. We represent each verb concept as a graph node
that has edges (relationships) such as: hasSubject, hasVerbSymbol, hasObject,
and hasIndirectObject. Fig. 10 shows an example of the verb concept market
operator operates a trading venue.
1 https://neo4j.com/
2 https://neo4j.com/developer/cypher-query-language/
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Graphical Representation of Rules</title>
        <p>Legal rules are more complex than noun and verb concepts. Each rule includes
one or more applicability conditions that determine whether a given action is
relevant to a given rule or not, and one or more deontic conditions that
determine whether a relevant action complies with or breaches a rule. In our current
implementation, we represent a legal rule as a graph node that is connected to
the graph nodes of applicability condition and deontic condition with the edges
hasApplicabilityCondition and hasDeonticCondition. The nodes of applicability
condition and deontic condition have edges associatedWith connecting them to
action (verb concept) nodes.</p>
        <p>Fig. 11 shows an example of graphical representation of the rule used
throughout the paper (Rule 1). This rule has key-value pairs containing some basic
information such as the original regulatory text shown in the bottom bar. The rule1
node connects two deontic condition nodes and one applicability condition node.
Each of them is connected to a verb concept node by the edge associatedWith.
The rules and vocabularies represented in property graphs can be queried and
retrieved by users. Queries over graph databases are often graph patterns. Here,
we use the Cypher language of the Neo4j graph database to formulate graph
patterns and pose the Cypher queries in the graph database to retrieve graph
data. Note that queries can also be visualised since they are graphs with
variables. We also formulate some common queries as query templates which can
help the users who have no knowledge of Cypher to formulate their queries.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>This paper presents visualisation needs and enhancements for a rule-editing tool
used by legal experts to achieve a machine-readable interpretation of legal
requirements with a semi-structured controlled natural language. The paper
presented knowledge graphs as a way to visualize an interpreted rule and all its
relevant elements in a format that the lawyer can understand and manipulate.
This is meant to ensure that the machine-readable output of the regulation
interpretation process is semantically enriched as intended by the legal expert,
thus ensuring the reliability of the interpretation stored in the machine-readable
format. Next steps of the research include further investigation of graphing
solutions. We anticipate that this might bring us to reconsider some basic
formalization principles derived from SBVR, which in turn might lead us to reconsider
some modelling choices in Mercury.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>EY</surname>
          </string-name>
          <article-title>'s 2015 global governance, risk and compliance survey: Innovating with RegTech (</article-title>
          <year>2015</year>
          ), http://www.ey.com/Publication/vwLUAssets/ EY-Innovating
          <article-title>-with-RegTech/\$FILE/EY-Innovating-with-RegTech.pdf</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Abi-Lahoud</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>O'Brien</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Butler</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>On the road to regulatory ontologies: Interpreting regulations with SBVR</article-title>
          .
          <source>In: AI</source>
          Approaches to the
          <source>Complexity of Legal Systems. Lecture Notes in Arti cial Intelligence</source>
          , vol.
          <volume>8929</volume>
          , pp.
          <volume>188</volume>
          {
          <fpage>201</fpage>
          . Springer Berlin (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Al</given-names>
            <surname>Khalil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Ceci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Yapa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>O'Brien</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          :
          <article-title>SBVR to OWL 2 mapping in the domain of legal rules</article-title>
          .
          <source>In: International Symposium on Rules and Rule Markup Languages for the Semantic Web</source>
          . pp.
          <volume>258</volume>
          {
          <fpage>266</fpage>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Arner</surname>
            ,
            <given-names>D.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barberis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buckley</surname>
            ,
            <given-names>R.P.</given-names>
          </string-name>
          , et al.:
          <article-title>The emergence of RegTech 2.0: From know your customer to know your data</article-title>
          .
          <source>Journal of Financial Transformation</source>
          <volume>44</volume>
          ,
          <issue>79</issue>
          {
          <fpage>86</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</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>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patel-Schneider</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>The description logic handbook: Theory, implementations and applications</article-title>
          . Cambridge U. Press, Cambridge, England (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ceci</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Al</given-names>
            <surname>Khalil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>O'Brien</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          :
          <article-title>Making sense of regulations with SBVR</article-title>
          .
          <source>In: Proceedings of the RuleML 2016 Challenge, Doctoral Consortium and Industry Track</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Ceci</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Al</given-names>
            <surname>Khalil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>O'Brien</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Butler</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          :
          <article-title>Requirements for an intermediate language bridging legal text and rules</article-title>
          . In: Workshop on `
          <article-title>MIning and REasoning with Legal texts' (MIREL)</article-title>
          . Nice, France (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ceci</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Butler</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>O'Brien</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Al Khalil</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Legal patterns for di erent constitutive rules</article-title>
          .
          <source>In: Workshop on `MIning and REasoning with Legal texts' (MIREL)</source>
          . pp.
          <volume>1</volume>
          {
          <fpage>11</fpage>
          .
          <string-name>
            <surname>Kings</surname>
            <given-names>College</given-names>
          </string-name>
          , London (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Gordon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rotolo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Rules and norms: Requirements for rule interchange languages in the legal domain</article-title>
          .
          <source>Rule interchange and applications</source>
          pp.
          <volume>282</volume>
          {
          <issue>296</issue>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shek</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Rule based business process compliance</article-title>
          .
          <source>In: RuleML (2)</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. van Haarst,
          <string-name>
            <surname>R.</surname>
          </string-name>
          :
          <article-title>SBVR made easy: Business vocabulary and rules as a critical asset</article-title>
          .
          <source>Conceptual Heaven</source>
          , Amsterdam (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. Ho er,
          <string-name>
            <surname>S.</surname>
          </string-name>
          , Bunzli, A.:
          <article-title>Designing a controlled natural language for the representation of legal norms</article-title>
          .
          <source>In: Second Workshop on Controlled Natural Languages</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Maranhao</surname>
            ,
            <given-names>J.S.:</given-names>
          </string-name>
          <article-title>A logical architecture for dynamic legal interpretation</article-title>
          .
          <source>In: 16th International Conference on Arti cial Intelligence and Law (ICAIL)</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Object Management</surname>
          </string-name>
          <article-title>Group (OMG): Semantics of Business Vocabulary and Rules (SBVR)</article-title>
          .
          <source>Speci cations (May</source>
          <year>2017</year>
          ), http://www.omg.org/spec/SBVR/1.4/
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>O</given-names>
            <surname>'Brien</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Abi-Lahoud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Lombard</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.:</surname>
          </string-name>
          <article-title>Using business natural language to capture nancial regulations in a collaborative ontology development process</article-title>
          .
          <source>In: Law Via the Internet. Jersey (26-27 September</source>
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Siena</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mylopoulos</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Susi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>From laws to requirements</article-title>
          .
          <source>In: Requirements Engineering and Law (RELAW'08)</source>
          . pp.
          <volume>6</volume>
          {
          <issue>10</issue>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Wyner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peters</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>On rule extraction from regulations</article-title>
          .
          <source>In: JURIX</source>
          . vol.
          <volume>11</volume>
          , pp.
          <volume>113</volume>
          {
          <issue>122</issue>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>