<!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>Challenges in Legal Process Discovery⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hugo A. Lo´pez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science University of Copenhagen</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>One of the main promises of process conformance is the opportunity to align normative processes (i.e. how the process should behave) and event logs (i.e. how does the process actually behaves). Results of conformance checking are valid as long as normative processes correspond to actual norms. Recent developments advocate the use of Natural Language Processing (NLP) to process model discovery from texts. We present a series of challenges in textual process discovery that limit its applicability to real norms. The challenges emerges from experiences with legal practitioners in the digitalization of administrative processes in Danish and Italian municipalities, and they need to be solved in order to provide accurate normative processes that reflect the intent of laws.</p>
      </abstract>
      <kwd-group>
        <kwd>Natural Language Processing</kwd>
        <kwd>Normative Processes</kwd>
        <kwd>Process Discovery</kwd>
        <kwd>Process Conformance</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        More than thirty years separate us from Sergot’s seminal work on Compliance
by Design [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In principle, the compliance problem remains the same: given a
law, ensure that all executions of a process behave in accordance with the rights
and obligations there established, and that it never allows the violations ruled
in the law. Specifically, this requires us 1) to provide a formal representation of
laws, 2) to establish a formal link between legal policies and events in a process,
and 3) to verify that the execution of events does not violate the specification.
Process compliance is close to the heart of BPM, where processes operate in
environments heavily regulated such as manufacturing, banking or healthcare.
However, while decades of research have looked at the semantic representation
of norms and compliance verification, fewer eforts have been placed in the
elicitation of normative policies for compliance. Laws are declarative artefacts that
contain events, decisions, rights, obligations, violations and relations between
them. Assuming a representation framework for the specification of laws (either
in terms of logics [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1, 2, 3, 4</xref>
        ], or models [
        <xref ref-type="bibr" rid="ref2 ref5 ref6 ref7 ref8">5, 2, 6, 7, 8</xref>
        ]), how are formal policies
related to the legal articles in a law?
      </p>
      <p>
        Rather than focusing on expressiveness considerations in compliance
languages (that have been covered in diferent surveys, e.g. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]), our focus is on
⋆ Copyright ' 2021 for this paper by its authors. Use permitted under Creative
      </p>
      <p>Commons License Attribution 4.0 International (CC BY 4.0).
⋆⋆ Work supported by the Innovation Fund Denmark project EcoKnow (7050-00034A)
mechanising the mapping between a (textual) law and its formal representation.
Legal specialists are not trained in compliance languages and they need support
to generate formal representations of the law. This requires a triple efort: first,
they need to parse the law and identify which fragments can be formalized,
second, for each candidate rule, encode the fragments in terms of a formal
specification that is semantically equivalent (modulo theory) to the original text. Finally,
such interpretations need to be validated so there is a congruence between the
possible worlds encoded in the specification, and the legal interpretation. Thus
our problem, in short, is:</p>
    </sec>
    <sec id="sec-2">
      <title>How can we discover normative models that preserve the intended semantics of laws in a time-eficient way?</title>
      <p>
        The challenges reported in this paper result from 4 years of interactions
between the author and municipal sectors in Denmark and Italy in the
formalization of laws using DCR graphs in the EcoKnow project [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The challenges
presented here are not particular to a modelling notation and thus they
correspond to any modelling technique used to generate normative models.
      </p>
      <sec id="sec-2-1">
        <title>2 Elicitation of normative models via NLP</title>
        <p>
          NLP is a key enabling technology for solving our question. Instead of discovery
from event logs, NLP allows the identification of processes from texts. This is
necessary for the discovery of normative models as ambiguity, length and complexity
of laws hinder discovery results. While discovery techniques present encouraging
results for (short, imperative) process descriptions, there is no evidence of its
application to laws. Moreover, initial application of discovery methods in
industrial settings reveals that there is still work to mature the technologies [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. The
challenges emerged from interactions with case workers, lawyers and consultants
with domain expertise in danish and italian laws. They resulted in the
elicitation of an annotation guideline as an initial step to create corpora containing
manually assigned process-law pairs [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Our initial experiments in the
Danish laws included annotations of 55 articles from the danish administrative acts
for family and social services [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. In the italian case, we focused on municipal
laws governing the release of construction permits [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. Both groups performed
textual annotations of laws into process elements, with a follow-up including
interviews and think-out-loud sessions. The most interesting challenges follow:
        </p>
        <sec id="sec-2-1-1">
          <title>2.1 Challenges for general textual process discovery</title>
          <p>
            Challenge 1: The process in the law Any law contains several pages of text
combining technical and non-technical information. Technical information refers
to rules and procedures required to generate a legal outcome. In a sense, this
is related to the (deontic) logics, whose aim is “the study of those sentences in
which only logical words and normative expressions occur essentially. Normative
expressions include the words ‘obligation’, ‘duty’, ‘permission’, ‘right’, and
related expressions” [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ]. A discovery algorithm needs to select only the technical
information in the law, filtering non-process information to avoid false-positives.
Challenge 2: Adequate process representations Most textual discovery
methods assume that their inputs are imperative processes. For instance,
parsing techniques in [
            <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
            ] assume constructs such as start and end nodes. This
information does not exist in laws: some rights are inherent, and they are valid
for as long as their clauses remain valid.
          </p>
          <p>
            Challenge 3: Sentence ambiguity Most works on automated process
discovery rely on syntax-driven parsing (SDP) where building the abstract syntax tree
is important to generate the formula representation of the process [
            <xref ref-type="bibr" rid="ref18 ref19 ref20">18, 19, 20</xref>
            ].
However, SDPs do not consider ambiguities in the semantic of the sentence. For
example:
          </p>
          <p>If the agent has completed his additional support and the clerk has issued the
money order, the clerk closes the claim.
and
The claim is closed by the clerk if additional support is completed by the agent
and the money order is issued by the clerk.</p>
          <p>
            Contain the same rule pattern with antecedents (the agent) completes
additional support and (the clerk) issues money order, and consequent (the clerk)
closes the claim. This challenge is of particular importance in laws: they are
typically written in passive voice, complicating the identification of atoms and
rules. The introduction of passive and active voice sentences created divergence
in the way legal annotators produced atoms and rules, leading to challenges in
interannotator agreement in similar way than law annotations [
            <xref ref-type="bibr" rid="ref21">21</xref>
            ].
Challenge 5: Textual process discovery metrics While there is a standard
set of measures to benchmark process discovery algorithms for logs [
            <xref ref-type="bibr" rid="ref22">22</xref>
            ], there
is no consensus on what will be the measures for textual process discovery.
The algorithms in [
            <xref ref-type="bibr" rid="ref16 ref18 ref19 ref23">16, 18, 19, 23</xref>
            ] all difer in the target modelling language.
While each work provides an evaluation in terms of precision, measurements like
iftness cannot be applied since there are no explicit traces. In our experience
with lawyers, normative models are tested for validity based on their abilities to
replicate legal precedents, that is, previous cases from the law [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ].
          </p>
        </sec>
        <sec id="sec-2-1-2">
          <title>2.2 Challenges specific to process discovery of legal texts</title>
          <p>
            Challenge 6: What is a legal event? Most works in process discovery using
NLP start considering linguistic patterns in [
            <xref ref-type="bibr" rid="ref16">16</xref>
            ] to identify events and activities.
Here it is assumed that activities are written in a verb-object pattern (e.g.:
pay compensation for loss of earnings ). Discovering legal events requires us to
extend this notion to rights and obligations. Sometimes, event detection will
acknowledge the formal recognition for which an event has been performed, as
in “Compensation shall be subject to the condition that the child is cared for
at home as a necessary consequence of the impaired function” [
            <xref ref-type="bibr" rid="ref24">24</xref>
            ].
Such forms do not correspond to linguistic patterns in the state of the art.
Challenge 7: Policy-formula mismatch A common textual process discovery
technique is the identification of stopwords [
            <xref ref-type="bibr" rid="ref25">25</xref>
            ]. Our experience is that stopwords
are a necessary but not suficient condition for semantic rule discovery. Assume
an interpretation in Linear Temporal Logic3. A response pattern is modelled as
the LTL formulae G(A → FB) and it is associated with an obligation: In all
cases, if A is executed, there exists an eventual execution of B. For example:
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>The municipal council shall pay compensation for loss of earnings to persons maintaining a child under 18 in the home whose physical or mental function is substantially and permanently impaired</title>
      <p>While the formula G(maintainChildU nder18(X, Y ) ∧ physicalM entalImpairment(Y ) →
FP ayCompensation(X)) is expressible in LTL, the interpretation will be
contested by a lawyer as this allows a payment on the negation of the antecedents.
Modifying the interpretation (e.g. adding a condition relation between the
antecedents and the consequence) does not generalize for all uses of “shall”.
Interpretations are context-dependent.</p>
      <p>Challenge 8: Compositionality Laws are not monolithic artefacts, and
creating specifications from them need compositional operators. For example, in:</p>
    </sec>
    <sec id="sec-4">
      <title>CASS 48.–(1) Before the municipal council makes a decision under sec</title>
      <p>tions 51–63, section 65(2) and (3) and sections 68–71 and 75,
the child or young person must be consulted on these matters.</p>
      <p>The model can only be expressed if we can compose §48 with §51, 52, etc.</p>
      <sec id="sec-4-1">
        <title>3 Initial ideas towards solving the problem</title>
        <p>
          We believe that there is still a great deal of work to do in order to make business
processes mining from text work in industrial cases. Solving the first 5 challenges
require a synergy between the NLP-BPM community to release resources (e.g.:
corpora, models) for inspection and benchmarking. Moreover, we advocate for a
co-created approach to textual process discovery. Rather than building the most
accurate set of parsing rules, it is important to i) Embed expert knowledge on
what is important in discovery, ii) Disambiguate texts, and iii) Implement
techniques that can learn from users. From the language perspective, we see a
growing interest in declarative process discovery techniques based on DECLARE [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ],
ATDP [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ] and DCR graphs [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. They can be adapted in the context of laws.
Tools like the Process Highlighter [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] or the Model Judge [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] allow us to filter
what should be captured as process information (challenge 1), capture
knowledge such as what constitutes an event (challenge 6) and the semantics of legal
rules (challenge 7). Tools might benetfi from the integration with legal event
detection [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] and norm-type classifiers [
          <xref ref-type="bibr" rid="ref30 ref31">30, 31</xref>
          ].
        </p>
        <p>
          A second enabler to make discovery usable are language models trained
in laws (challenge 3). While general-purpose models (e.g. BERT [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ]) capture
3 The same pattern appears in other languages, e.g.: DCR graphs
context-dependency and short-ranging references, they might give wrong results
due to the variety of texts they are trained on. Scalability is a factor to consider:
the attention layers in transformer architectures scale quadratically. This limits
the length of textual analysis and imposes limitations for discovery.
        </p>
        <p>
          Third, dialogue systems can provide feedback to users about the semantics of
each sentence. Surface patterns are indicators of intended meanings [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ] that can
be refined by presenting characteristic traces. This is fundamental to refine the
mappings from surface text to formal semantics, thus reducing misinterpretations
(challenge 7). Event-log generation from texts [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ] might be able to contrast
exemplary traces with user’s intended meaning.
        </p>
        <p>
          Finally, a necessary step for discovery is the integration of parsers based on
formal meaning representation (MR) frameworks [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ]. MR aim to represent texts’
formal structure (e.g. graph-based meaning representations), reducing parsers
imprecision in sentence variants with the same intended meaning (challenge 3).
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Sergot</surname>
            ,
            <given-names>M.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sadri</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kowalski</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kriwaczek</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hammond</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cory</surname>
          </string-name>
          , H.T.:
          <article-title>The British Nationality Act As a Logic Program</article-title>
          .
          <source>C.ACM</source>
          <volume>29</volume>
          (
          <issue>5</issue>
          ) (
          <year>1986</year>
          )
          <fpage>370</fpage>
          -
          <lpage>386</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Ly</surname>
            ,
            <given-names>L.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rinderle-Ma</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knuplesch</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dadam</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Monitoring Business Process Compliance Using Compliance Rule Graphs</article-title>
          .
          <source>In: OTM. LNCS</source>
          , Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ghose</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koliadis</surname>
          </string-name>
          , G.:
          <article-title>Auditing Business Process Compliance</article-title>
          . In: ServiceOriented Computing - ICSOC
          <year>2007</year>
          . LNCS, Springer (
          <year>2007</year>
          )
          <fpage>169</fpage>
          -
          <lpage>180</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sadiq</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The journey to business process compliance</article-title>
          .
          <source>IGI global</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Awad</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weidlich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Visually specifying compliance rules and explaining their violations for business processes</article-title>
          .
          <source>JVLC</source>
          <volume>22</volume>
          (
          <issue>1</issue>
          ) (
          <year>2011</year>
          )
          <fpage>30</fpage>
          -
          <lpage>55</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ramezani</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fahland</surname>
          </string-name>
          , D., van der Aalst, W.:
          <article-title>Supporting domain experts to select and configure precise compliance rules</article-title>
          .
          <source>LNBIP</source>
          <volume>171</volume>
          (
          <year>2014</year>
          )
          <fpage>498</fpage>
          -
          <lpage>512</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Burattin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sperduti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Conformance checking based on multiperspective declarative process models</article-title>
          .
          <source>Expert Syst. Appl</source>
          .
          <volume>65</volume>
          (
          <year>2016</year>
          )
          <fpage>194</fpage>
          -
          <lpage>211</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. Lop´ez,
          <string-name>
            <given-names>H.A.</given-names>
            ,
            <surname>Debois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Slaats</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Hildebrandt</surname>
          </string-name>
          , T.T.:
          <article-title>Business Process Compliance Using Reference Models of Law</article-title>
          .
          <source>In: FASE. LNCS</source>
          , Springer (
          <year>2020</year>
          )
          <fpage>378</fpage>
          -
          <lpage>399</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hashmi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Governatori</surname>
          </string-name>
          , G.:
          <article-title>Norms modeling constructs of business process compliance management frameworks: a conceptual evaluation</article-title>
          .
          <source>AI</source>
          &amp;
          <string-name>
            <surname>Law</surname>
          </string-name>
          (
          <year>2017</year>
          )
          <fpage>1</fpage>
          -
          <lpage>55</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hildebrandt</surname>
          </string-name>
          , T.T.,
          <string-name>
            <surname>Andaloussi</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Christensen</surname>
            ,
            <given-names>L.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Debois</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Healy</surname>
            ,
            <given-names>N.P.</given-names>
          </string-name>
          , Lop´ez,
          <string-name>
            <given-names>H.A.</given-names>
            ,
            <surname>Marquard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Møller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.L.H.</given-names>
            ,
            <surname>Petersen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.C.M.</given-names>
            ,
            <surname>Slaats</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Weber</surname>
          </string-name>
          ,
          <string-name>
            <surname>B.</surname>
          </string-name>
          :
          <article-title>Ecoknow: Engineering efective, co-created and compliant adaptive case management systems for knowledge workers</article-title>
          .
          <source>In: ICSSP</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2020</year>
          )
          <fpage>155</fpage>
          -
          <lpage>164</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Bellan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dragoni</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghidini</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>A Qualitative Analysis of the State of the Art in Process Extraction from Text</article-title>
          .
          <volume>2776</volume>
          <fpage>19</fpage>
          -
          <lpage>30</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. Lo´pez, H.A.:
          <article-title>Extraction of Processes from Laws: Annotation Guidelines v1.1. shorturl</article-title>
          .at/ahmnK (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <article-title>The Danish Ministry of Social Afairs and the Interior: Consolidation Act on Social Services (September 2015) Executive Order no</article-title>
          .
          <volume>1053</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. Regione Liguria:
          <article-title>Legge regionale n.16 del 6 giugno 2008 e successive modifiche (2008) shorturl</article-title>
          .at/kAP58.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Flølesdal</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hilpinen</surname>
          </string-name>
          , R.:
          <article-title>Deontic logic: An introduction</article-title>
          .
          <source>In: Deontic logic: Introductory and systematic readings</source>
          . Springer (
          <year>1970</year>
          )
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendling</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Puhlmann</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Process Model Generation from Natural Language Text</article-title>
          . In: CAiSE. LNCS, Springer (
          <year>2011</year>
          )
          <fpage>482</fpage>
          -
          <lpage>496</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>Soares</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Toralles Avila</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Ampos</surname>
          </string-name>
          <string-name>
            <surname>Flesch</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Marques</given-names>
            <surname>Peres</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Thom</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.H.</surname>
          </string-name>
          :
          <article-title>A Service-Oriented Architecture for Generating Sound Process Descriptions</article-title>
          . In: EDOC. (
          <year>2019</year>
          )
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          ISSN:
          <fpage>2325</fpage>
          -
          <lpage>6362</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>van der Aa</surname>
            , H., di Ciccio,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leopold</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reijers</surname>
            ,
            <given-names>H.A.</given-names>
          </string-name>
          :
          <article-title>Extracting Declarative Process Models From Natural Language</article-title>
          . In: CAiSE, Springer (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Quishpi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carmona</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Pador,´ L.:
          <article-title>Extracting Annotations from Textual Descriptions of Processes</article-title>
          .
          <source>In: BPM. LNCS</source>
          , Springer (
          <year>2020</year>
          )
          <fpage>184</fpage>
          -
          <lpage>201</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. Lo´pez,
          <string-name>
            <given-names>H.A.</given-names>
            ,
            <surname>Marquard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Muttenthaler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Strømsted</surname>
          </string-name>
          , R.:
          <article-title>Assisted Declarative Process Creation from Natural Language Descriptions</article-title>
          . In: EDOCW. (
          <year>2019</year>
          )
          <fpage>96</fpage>
          -
          <lpage>99</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Witt</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huggins</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buckley</surname>
          </string-name>
          , J.:
          <article-title>Converting copyright legislation into machine-executable code: Interpretation, coding validation and legal alignment</article-title>
          .
          <source>In: Proceedings of the 18th International Conference on Artificial Intelligence and Law</source>
          (ICAIL),
          <source>Association for Computing Machinery (ACM)</source>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Buijs</surname>
            ,
            <given-names>J.C.A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>van Dongen</surname>
            ,
            <given-names>B.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          :
          <article-title>On the Role of Fitness, Precision, Generalization and Simplicity in Process Discovery</article-title>
          .
          <source>In: OTM</source>
          . Volume
          <volume>7565</volume>
          . Springer (
          <year>2012</year>
          )
          <fpage>305</fpage>
          -
          <lpage>322</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. Lo´pez,
          <string-name>
            <given-names>H.A.</given-names>
            ,
            <surname>Strømsted</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Niyodusenga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Marquard</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Declarative process discovery: Linking process and textual views</article-title>
          .
          <source>In: CAiSE Forum. Volume 424 of Lecture Notes in Business Information Processing.</source>
          , Springer (
          <year>2021</year>
          )
          <fpage>109</fpage>
          -
          <lpage>117</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Debois</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Lop´ez,
          <string-name>
            <given-names>H.A.</given-names>
            ,
            <surname>Slaats</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Andaloussi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.A.</given-names>
            ,
            <surname>Hildebrandt</surname>
          </string-name>
          , T.T.:
          <article-title>Chain of Events: Modular Process Models for the Law</article-title>
          .
          <source>In: IFM. LNCS</source>
          , Springer (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Winter</surname>
            , K., van der Aa, H., Rinderle-Ma,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weidlich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Assessing the Compliance of Business Process Models with Regulatory Documents</article-title>
          .
          <source>In: ER. LNCS</source>
          , Springer (
          <year>2020</year>
          )
          <fpage>189</fpage>
          -
          <lpage>203</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Sa</surname>
          </string-name>
          <article-title>`nchez-</article-title>
          <string-name>
            <surname>Ferreres</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burattin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carmona</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montali</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pador</surname>
          </string-name>
          ,´ L.,
          <string-name>
            <surname>Quishpi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Unleashing textual descriptions of business processes</article-title>
          .
          <source>SoSyM</source>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27. Lo´pez,
          <string-name>
            <given-names>H.A.</given-names>
            ,
            <surname>Debois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Hildebrandt</surname>
          </string-name>
          , T.T.,
          <string-name>
            <surname>Marquard</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The process highlighter: From texts to declarative processes and back</article-title>
          .
          <volume>2196</volume>
          (
          <year>2018</year>
          )
          <fpage>66</fpage>
          -
          <lpage>70</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Delicado</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanchez-Ferreres</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carmona</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Padro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The Model Judge - A Tool for Supporting Novices in Learning Process Modeling</article-title>
          .
          <volume>2196</volume>
          <fpage>91</fpage>
          -
          <lpage>95</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Ferraro</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lam</surname>
            ,
            <given-names>H.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tosatto</surname>
            ,
            <given-names>S.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivieri</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Islam</surname>
          </string-name>
          , M.B.,
          <string-name>
            <surname>van Beest</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Automatic extraction of legal norms: Evaluation of natural language processing tools</article-title>
          . In: JSAI-isAI, Springer (
          <year>2019</year>
          )
          <fpage>64</fpage>
          -
          <lpage>81</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>de Maat</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>Winkels</surname>
          </string-name>
          , R.:
          <source>Automated Classification of Norms in Sources of Law. In: Semantic Processing of Legal Texts</source>
          . Volume
          <volume>6036</volume>
          . Springer (
          <year>2010</year>
          )
          <fpage>170</fpage>
          -
          <lpage>191</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Waltl</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bonczek</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scepankova</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Matthes</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Semantic types of legal norms in German laws: classification and analysis using local linear explanations</article-title>
          .
          <source>AT &amp; Law</source>
          <volume>27</volume>
          (
          <issue>1</issue>
          ) (
          <year>2019</year>
          )
          <fpage>43</fpage>
          -
          <lpage>71</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          : BERT:
          <article-title>Pre-training of Deep Bidirectional Transformers for Language Understanding</article-title>
          . arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Ackermann</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neuberger</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jablonski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Data-driven annotation of textual process descriptions based on formal meaning representations</article-title>
          .
          <source>In: CAiSE</source>
          , Springer (
          <year>2021</year>
          )
          <fpage>75</fpage>
          -
          <lpage>90</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>