<!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>Using Issues to Explain Legal Decisions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Plainti Factors Defendant Factors F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Bribe-Employee F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Disclosure-In-Negotiations F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Agreed-Not-To-Disclose F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Employee-Sole-Developer F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Security-Measures F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Agreement-not-speci c F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Brought-Tools F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Secrets-Disclosed-Outsiders F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Competitive-Advantage F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Vertical-Knowledge F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Outsider-Disclosures-Restricted F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Info-Reverse-Engineerable F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Noncompetition-Agreement F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Info-Independently-Generated F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Restricted-Materials-Used F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d No-Security-Measures F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Unique-Product F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Info-Known-to-Competitors F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Identical-Products F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Waiver-of-Con dentiality F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Knew-Info-Con dential F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Info-Obtainable-Elsewhere F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Invasive-Techniques F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Info-Reverse-Engineered F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>p Deception F</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>d Disclosure-In-Public-Forum</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Liverpool</institution>
          ,
          <addr-line>Liverpool</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The need to explain the output from Machine Learning systems designed to predict the outcomes of legal cases has led to a renewed interest in the explanations o ered by traditional AI and Law systems, especially those using factor based reasoning and precedent cases. In this paper we consider what sort of explanations we should expect from such systems, with a particular focus on the structure that can be provided by the use of issues in cases.</p>
      </abstract>
      <kwd-group>
        <kwd>Reasoning with cases</kwd>
        <kwd>Explanation</kwd>
        <kwd>Legal Reasoning</kwd>
        <kwd>Factors</kwd>
        <kwd>Issues</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Currently there is much interest in the use of Machine Learning (ML) based
approaches to predict legal decisions. The European Convention on Human Rights
alone has been the subject of a cluster of such systems including [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ],
[
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] and [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ]. Using such systems in legal applications, however, raises a number
of issues [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], including bias, adapting to changes in statute law, case law and
social values, and, perhaps most important, the lack of explanation. In law there
is a right to explanation [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] and so providing explanations is essential. This has
long been recognised in AI and Law and the provision of explanations has been
a central feature of systems developed in the eld [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. It is therefore a natural
move to see whether it is possible to use the techniques developed to explain the
outputs of systems previously developed in AI and Law to explain the outputs
of ML systems. In particular the factor based reasoning developed for the CATO
system [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and widely adopted in subsequent systems [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] has been proposed as a
suitable candidate for this role. In [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] the idea is to rst ascribe factors to cases
using ML and then to explain the outcomes in terms of these factors. In [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ],
the proposal is to produce the explanation from a case based system running in
parallel with the ML system.
      </p>
      <p>In this paper we consider what sort of explanations we can expect from such
systems, with a particular focus on the structure that can be provided by the
use of issues in cases.</p>
    </sec>
    <sec id="sec-2">
      <title>Background: Factor Based Reasoning in CATO</title>
      <p>
        We begin by describing factor based reasoning in CATO [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], which is the starting
point for subsequent accounts of factor based reasoning [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. CATO is directed
towards the domain of US Trade Secrets, and is largely based on the law as
set out in the Restatement of Torts 1. In CATO cases are represented as sets of
factors. Factors are ascribed on the basis of stereotypical patterns of facts which
have legal signi cance in that they provide a reason to nd for one of the parties.
CATO has thirteen factors for each side, as shown in Table 1. The conditions for
ascribing them to cases are given in Appendix 2 of [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Note that the absence of
a factor is not in general a reason to nd the other party: in the rare cases where
the absence of a factor might favour the other side, a second distinct factor for
the party favoured is used. The only examples of this in CATO are F6p and
F19d, which relate to security measures. Note, however, that it may be that
neither F6p or F19d is present in the case: even if security measures were taken,
so that there is no reason to nd for the defendant on this aspect, they may not
have been su cient to provide a reason to nd for the plainti , and so that the
aspect is neutral. The factors from [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] have been reused by many subsequent
researchers, including [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], [
        <xref ref-type="bibr" rid="ref52">52</xref>
        ] and [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ].
      </p>
      <p>
        When presented with a new case a three ply argument is constructed. In the
rst ply a proponent cites the most-on-point precedent (i.e. the precedent with
the greatest overlap of factors irrespective of which side they favour) decided
for the side being argued for. Suppose this is the plainti . In the second ply the
opponent either cites a counterexample (a case which favours the defendant and
is at least as on point as the case cited by the plainti ) or distinguishes the
precedent by pointing to a factor favouring the plainti in the precedent but not
the new case, or a factor favouring the defendant in the current case but not
the precedent. In the third ply the plainti o ers a rebuttal by distinguishing
the counterexamples, or downplaying the distinguishing factor by pointing to a
1 The relevant section, section 757, Liability for disclosure or use of another's Trade
Secret, can be found at https://www.lrdc.pitt.edu/ashley/restatem.htm.
factor which can cancel the additional factor or a factor which can be substituted
for the absent factor [
        <xref ref-type="bibr" rid="ref41">41</xref>
        ].
      </p>
      <p>CATO organised its factors into a factor hierarchy. At the upper level are
issues, and below these are layers of abstract factors before the leaf nodes are
reached. These leaf nodes are the base level the factors shown in Table 1. The
importance of this hierarchy is for determining whether distinctions can be
downplayed: a factor can only be substituted for or cancel another factor if they have
a common ancestor. The closer the ancestor the more persuasive the downplay.
How persuasive the downplay is matters for prediction, where the success or
otherwise of the rebuttal needs to be decided, but not for for explanation. The
success or otherwise of the rebuttal is given by the outcome of the case, which
shows whether or not the downplay was successful.</p>
      <p>
        CATO's factor based model has inspired a number of formal accounts of
precedential constraint [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ], [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ] and [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ]. These models are based on a
way of representing precedents originating in [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ]. Suppose we have a case with
plainti factors P and defendant factors D. Now the strongest reason to nd
for the plainti will be the conjunction of all the factors in P and the strongest
reason to nd for the defendant the conjunction of all the factors in D. The
outcome of the case will show which reason was preferred. A decision is taken
to be constrained in these approaches if deciding for the other party would
introduce an inconsistency into the set of preferences in the precedent base2.
Using all the factors available for the winning side is termed the results model in
[
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. It may be, however, that a subset of the factors for the winning side is still
su cient to overcome the reason for the losing side. This would allow a subset
of the winner's factors to be used in the preference. This is termed the reason
model in [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. A comparison of the two models is given in [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ].
      </p>
      <p>
        The reasoning in CATO: citation, distinguishing and counterexample,
followed by rebuttal through downplaying distinctions and distinguishing counter
examples was expressed as a set of argumentation schemes in [
        <xref ref-type="bibr" rid="ref51">51</xref>
        ] and formalised
in ASPIC+ in [
        <xref ref-type="bibr" rid="ref41">41</xref>
        ]. This formalisation uses the results model, and uses the full
set of factors available to both sides. These schemes were proposed as a means of
providing explanation for ML systems in [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ]. We will discuss the explanations
from [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ] in the next section.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Explanation with Argument Schemes</title>
      <p>
        Explanation in [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ] takes the form of a dialogue modelling the three ply
argumentation structure of CATO. An example dialogue is shown in Figure 1. Figure
1 illustrates a particular example used in [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ]. The two precedent cases and the
new case in that example are shown in Table 2. I have given the cases mnemonic
names. The top layer, put forward by the proponent, is an argument based on
citing a precedent case. The second layer, objections by the opponent, comprises
objections based on each of the two types of distinction (O1a and O1c), and a
2 In practice this formal notion of constraint may not actually be respected in a given
judicial setting. For a jurisprudential discussion see [
        <xref ref-type="bibr" rid="ref47">47</xref>
        ].
counter example (O1b). The nal layer shows the proponent's rebuttals: each
objection is met by both a substitution and a cancellation (P 2a and P 20a for
O1a and P 2c and P 20c for O1c), and a rebuttal of the counterexample through
a \transformation", which means that substitutions and cancellations can
transform the case into a precedent for the proponent's side.
      </p>
      <p>The diagram in Figure 1 o ers an explanation for a plainti win in Bribe.
Deceived matches because the plainti took security measures (F6p) and
disclosed information to outsiders (F10d). The defendant can now cite
distinctions of both kinds: deception (F26p) was not used, and the information is
reengineerable (F16d) in the new case but not the precedent. Moreover NoMeasures
also matches on two factors and so is as on point as Deceived and so can serve
as a counter example. To counter O1a the plainti now argues (P 2a) that the
lack of deception does not matter because bribery was used (F2p) and this can
substitute for F26p. Alternatively it can be argued (P 20a) that the additional
defendant factor in the precedent, F24d, that the information was available
elsewhere, cancels the additional plainti strength of the precedent coming from
bribery. It is clear in this case that the substitution is more e ective: bribery
and deception play similar roles, both being di erent examples of the use of
improper means. In the case of the additional defendant factor in the new case,
F16d, used in O1c, it can be substituted by the additional factor in the
precedent, F24d (P 2b), or cancelled by the additional plainti factor, F2p (P 20b).
Again it seems that substitution is the better argument because of the similarity
of the roles of F16d and F24d.</p>
      <p>
        The fact that the substitutions are clearly better rebuttals than the
cancellations (in this case: for other examples the reverse will be true) highlights a
problem with the explanation. Although the arguments generated by the de
nitions are possible arguments in that they conform to the de nitions of [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ],
they lack plausibility because they relate to entirely di erent concerns. That is,
these objections fail to make sense in domain terms. In CATO the strength of
a downplay depended on how close the factors were in the factor hierarchy. In
Figure 1, however, it is not possible to tell which rebuttal succeeded, or whether
a combination of the two was required. All the candidate arguments are
presented, but it is the user that must supply the domain knowledge to assess how
strong these arguments are, and which objections and rebuttals should succeed
in the particular case. The reason for the decision is there, but the user must
extract it. In order to guide the user, we turn to consider the knowledge of the
structure of the domain represented by the use of issues.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Issues</title>
      <p>
        In CATO the top level of the factor hierarchy was made up of issues. The role of
issues in a case is to identify the salient points that need to be shown in order to
prove or defend a case, and, hence, the factors that are relevant to the di erent
points. Issues in CATO served mainly to organise the explanation. CATO
identi ed two main issues for Trade Secret misappropriation: the information had
to be a trade secret (with the burden of proof on the defendant to show that
it was not) and the information had to have been misappropriated (with the
burden of proof on the plainti ). Below these main issues were sub-issues. To
be a trade secret the information had to be valuable and its secrecy adequately
maintained. If the information was used, misappropriation could be shown either
through a breach of con dence or through the use of improper means by the
defendant. For a breach of con dence a con dential relation between plainti and
defendant had to exist. Issues took on a additional signi cance when CATO was
adapted to predict outcomes in the IBP system [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] when the issues formed a top
layer of necessary and su cient conditions (termed the logical model in [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]),
with factor based reasoning used to determine the status of the leaf issues. This
structure, strict logical rules at the top with case based reasoning to determine
which rules applied, was earlier used in CABARET [
        <xref ref-type="bibr" rid="ref48">48</xref>
        ], and was later adopted
and adapted to accommodate his value judgement formalism by Grabmair [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
Figure 2 shows top level logical model and the allocation of factor to issues in
[
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]3.
3 We use structure of the logical model in [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] which di ers slightly from that of [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
      </p>
      <p>We can now consider the example cases in Table 2 in terms of issues. We also
include in Table 3 some other actual cases we will mention in this paper4.
4 Mason v. Jack Daniel Distillery, 518 So.2d 130 (Ala.Civ.App.1987), Leo Silfen, Inc.
v. Cream, 29 N.Y.2d 387, Computer Print Systems v. Lewis, 422 A.2d 148 (1980),
K &amp; G Oil Tool &amp; Service Co. v. G &amp; G Fishing Tool Serv., 314 S.W.2d 782,
(1958),College Watercolor Group, Inc. v. William H. Newbauer, Inc., 468 Pa. 103,
360 A.2d 200 (1976), Arco Industries Corp. v. Chemcast Corp., 633 F.2d 435, 208
USPQ 190 (6th Cir.1980), E. V. Prentice Dryer Co. v. Northwest Dryer &amp; Machinery
Co., 246 Or. 78, 424 P.2d 227 (1967), Kinnear-Weed Corp. v. Humble Oil Re ning
Co. 150 F. Supp. 143 (E.D. Tex. 1956). Sheets v. Yamaha Motors Corp., USA, 657
F.Supp. 319 (1987), Commonwealth v. Robinson, 7 Mass.App.Ct. 470, 388 N.E.2d
705 (1979), MBL (USA) Corp. v. Diekman, 112 Ill.App.3d 229, 445 N.E.2d 418, 67
Ill.Dec. 938 (1983), A. H. Emery Co. v. Marcan Products Corporation, 380 F.2d 11
(1968), Ecologix, Inc. v. Fansteel, Inc., 676 F.Supp. 1374 (1988), Laser Industries,
Ltd. v. Eder Instrument Co., 573 F.Supp. 987 (1983), Sandlin v. Johnson, 152 F.2d 8
(8th Cir.1945), Trandes Corp. v. Guy F. Atkinson Co., 996 F.2d 655 (4th Cir.1993),
Ferranti Electric, Inc. v. Harwood, 43 Misc.2d 533, 251 N.Y.S.2d 612 (1964), The
Boeing Company v. Sierracin Corporation, 108 Wash.2d 38, 738 P.2d 665 (1987).
Note that the analysis into factors is mine, and for the purpose of illustration in this
paper. It should not be relied on in a court of law.</p>
      <p>
        Case
Deceived P
NoMeasures D
Bribed ?
Mason P
Silfen D
Lewis P
College P
Arco P
Sheets D
Robinson D
MBL D
Prentice D
Kinnera-Weed D
Emery P
Laser P
Sandlin D
Ecologix D
Trandes P
Ferranti D
Boeing P
CATO organised its explanation in terms of issues. The explanation of the
example in [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ] would be something like the following (adapted from the explanation
of Mason given in Figure 2.4 of [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]).
      </p>
      <sec id="sec-4-1">
        <title>Argument for Plainti in Bribed.</title>
        <p>Plainti should win a claim of trade secrets misappropriation. Plainti 's
information is a trade secret and defendant acquired plainti 's
information through improper means.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Plainti 's information is a trade secret.</title>
        <p>In Bribed, plainti adopted security measures [F6p] This shows that
plainti took e orts to maintain the secrecy of its information.
The fact that plainti disclosed its information to outsiders [F10d] does
not preclude a a conclusion that plainti 's information is a trade secret.
This is especially so where, as in Bribed, plainti took security measures
to protect the information [F6p]. [Deceived ]
The fact that plainti 's information could be ascertained by examining
or reverse engineering plainti 's product [F16d] does not preclude a
conclusion that plainti 's information is a trade secret [Mason]. Moreover
in Deceived, the information was available elsewhere, which is not the
case in Bribed.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Defendant acquired plainti 's information through improper</title>
        <p>means by bribing an employee [F2p].</p>
        <p>NoMeasures is not a counterexample with respect to secrecy being
maintained, since in that case, unlike Bribed, the plainti did not take
security measures to protect the secrecy of its information.</p>
        <p>Organising by issues has several advantages. First it means that di erences
relating to uncontested issues are not considered: since the use of improper means
is not contested, it does not matter which factor is used to establish it. This
prunes the O1a branch from the tree in Figure 1. Second when downplaying the
genuine distinction in O1c, it produces the correct rebuttal (P2c) because this
is the factor related to the same issue, and ignores P 20c. Also it explicitly cites
the preference for F6p in past precedents as the reason for citing the precedent
and rejecting the counterexample.</p>
        <p>
          The preference for F6p over F16d is justi ed by reference to Mason. Two
points should be made here: the misappropriation in Mason involved breach of
con dence rather than improper means. This does not matter when using issues,
but would provide a distinction for an approach without issues as used in [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]
and [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ]. This is true of the reason as well as the results model: F2p would have
to be included in the reason for Mason, since otherwise there would have been no
breach of con dence. Using issues to organise our factors enables reasoning with
portions of precedents [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], which makes substantially more precedents available
to make points. On the results model, even with issues, however, Mason would be
vulnerable to a distinction since it contains F15p whereas Bribed does not, which
provides an additional factor to outweigh F16d, suggesting that F6p might not
be preferred to F16d on its own. If we consider the decision in Mason, however,
we read:
        </p>
        <p>We note that absolute secrecy is not required ... for the recipe for
Lynchburg Lemonade to constitute a trade secret | "a substantial element of
secrecy is all that is necessary to provide trade secret protection." Drill
Parts, 439 So.2d at 49. The defendants also contend that Mason's recipe
was not a trade secret because it could be easily duplicated by others.
... We do not think, however, that this evidence in and of itself could
prevent such a conclusion. Rather, this evidence should be weighed and
considered along with the evidence tending to show the existence of a
trade secret. In this regard, we note that courts have protected
information as a trade secret despite evidence that such information could be
easily duplicated by others competent in the given eld. KFC Corp. v.
Marion-Kay Co., 620 F. Supp. 1160 (S.D.Ind. 1985); Sperry Rand Corp.
v. Rothlein, 241 F. Supp. 549 (D.Conn. 1964).</p>
        <p>
          Here there is no reference to the uniqueness of the product (F15p), and so
for the reason model we should take it that the decision in favour of Mason
indicates that F6p is preferred to F16d on its own, without needing the support
of F15p, and so Mason is available for use in Bribed when the reason model is
applied at the issue level. Note, however, that if we are using the distribution of
factors across issues in [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] that was shown in Figure 2, this would require us to
consider the preference at the level of the TradeSecret issue and that InfoValuable
is not required for the information to be a trade secret when F6p is present. We
prefer instead to include F6p under InfoValuable as well as MaintainSecrecy:
su cient secrecy measures are considered enough to justify the information being
deemed valuable. A factor can relate to more than one issue: for example F25d in
Figure 2. Putting F6p under InfoValuable to oppose F16d seems to accord with
the decision in Mason cited above. This enables us to continue to use the logical
model of [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] and [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] which requires Bribed to show both that the information
was valuable and that e orts to maintain secrecy had been taken. Without F6p
being included under InfoValuable this model would fail since that there is no
factor to contest the claim that F16d would mean that the information lacked
value.
4.2
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>The Centrality of Issues</title>
        <p>
          From the above discussion we see that organising explanations around issues
provides focus and enables irrelevant factors and uncontested issues to be
ignored, so avoiding swamping the recipient of the explanation with an excess
of information. This accords with the widespread popularity of the
Issue-RuleApplication-Conclusion (IRAC) methodology of legal analysis. IRAC is widely
taught in law schools5, although often there are variants which include an
additional item or reorder the items, perhaps beginning with the conclusion. IRAC
was advocated for the explanation of outcomes from factor based reasoning in
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>
          The question arises, however, as to what should be counted as an issue. Issues
could be very coarse grained such as was the information a trade secret?, or relate
to the ne grained abstract factors of the CATO factor hierarchy, such as did the
plainti take adequate security measures with respect to the defendant?. In the
next section we will o er a tree of issues in the form of an Abstract Dialectical
Framework (ADF) [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] as used for the representation of legal knowledge in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>An ADF of Issues</title>
      <p>
        Table 4 presents the issues used to decide questions of Trade Secret
Misappropriation in the form of an ADF. The decomposition of InfoMisappropriated follows
[
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] as shown in Figure 2 rather than [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Traditionally models of reasoning
with legal precedents include the rule model and the balance of factors model
[
        <xref ref-type="bibr" rid="ref49">49</xref>
        ]. The ADF in Table 4 uses the rule model in all the acceptance conditions,
5 For example, City University of New York
(https://www.law.cuny.edu/legalwriting/students/irac-crracc/irac-crracc-1/) and Elizabeth Haub School of Law
at Pace University
(https://academicsupport.blogs.pace.edu/2012/10/26/the-caseof-the-missing-a-in-law-school-you-cant-get-an-a-without-an-a/). Use of IRAC is
advocated by the LexisNexis survival guide for law students available at
https://www.lexisnexis.co.uk/students/law/.
      </p>
      <p>Info WrongDoing
Misappropriated InfoUsed
assuming that there are su cient precedents to justify the priorities in every
node. In Table 4 the fourth column shows the justi cation for the acceptance
condition: either the logical model implied by the Restatement or a precedent
which expressed a particular preference6.</p>
      <p>
        However, following the examples of CABARET [
        <xref ref-type="bibr" rid="ref48">48</xref>
        ] and Issue Based
Prediction (IBP) [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], at some point in each branch the rule model might not be
appropriate and so the balance of factors model would be required. This will
be particularly so in the early stages of the development of a body of case law,
when there will not yet be su cient precedents to determine all the required
preferences. For example, F18p (Unique Product) may be a strong indication
6 Because the use of issues mean that at most ve factors need to be considered for
any given node, it is feasible to envisage enough precedents to resolve the node. This
would not be so as the whole case level, where there are 226 possible models.
that the information was used, but might not be as decisive as suggested in the
ADF in Table 4. If we use a balance of factors model we can choose between
balancing the factors representing the children of the node in question or the
factors which result from unfolding the nodes below the node concerned. Thus
InfoTradeSecret could be resolved by regarding InfoValuable and
InfoTradeSecret as a conjunction so that both must be true (rule model); or allowing some
trade o between them (coarse grained balance of factors), or balancing the
relevant base level factors fF6p, F8p, F10d, F12p, F11d, F15p, F16d, F19d, F20d,
F24d, F27dg ( ne grained balance of factors). Also perhaps a mixed granularity
could be used, grouping some of the base level factors into abstract factors, e.g.
F10d and F12p could be considered together as MeasuresOutsiders. It would be
an interesting exercise to see what e ect these di erent granularities might have,
but for this paper we will assume a mature domain allowing us to use a pure
rule model.
5.1
      </p>
      <sec id="sec-5-1">
        <title>Using Issues for Explanation</title>
        <p>Now we have the ADF, we can identify the issues in particular cases. The issues
in a case will be the lowest nodes spanning both a pro-plainti factor and a
pro-defendant factor. We illustrate this principle by applying it to the cases in
Table 2:</p>
        <p>In Deceived MaintainSecrecy is an issue because Security Measures (F6p)
favours the plainti whereas MeasuresOutsiders favours the defendant (F10d).
Deceived was found for the plainti , and so MeasuresOutsiders F6p. We could
use Emery as a precedent to justify this preference. InfoValuable is also an issue
because it contains both F6p and F24d. Again since the plainti won we can
infer that InfoAvailableElsewhere F6p, a preference justi ed by Mason.</p>
        <p>In IRAC terms:
An issue is whether that there were no e orts to maintain secrecy with
respect to outsiders means that secrecy was not maintained. The rule is
that Not MeasuresOutsiders F6p (Emery ). Application is that Not
MeasuresOutsiders applies because F10d is present, but F6p is also
present. Therefore secrecy was maintained. A second issue is whether
that the information was obtainable elsewhere means that the
information was not valuable. The rule is InfoAvailableElsewhere F6p
(Mason). The rule applies because F24d establishes InfoAvailableElsewhere
and F6 is present. Therefore, the information was valuable.</p>
        <p>In NoMeasures only the root node, TradeSecretMisappropriation, spans
contested factors. Here the defendant can establish that the information is not a
trade secret because it wins both branches for that issue and so the defendant
is found for.</p>
        <p>In IRAC terms:
The issue is whether a Trade Secret was misappropriated, when the
information was misappropriated but not a trade secret. The rule is if not
InfoTradeSecret then not TradeSecretMisappropriation (Restatement of
Torts). The rule applies because the information was obtainable
elsewhere because F24d was present (Ferranti ) and the e orts to maintain
secrecy with respect to outsiders were inadequate because F10d is present
(Arco). Therefore there was no TradeSecretMisappropriation.</p>
        <p>In Bribed we have a situation similar to Deceived except that
InfoAvailableElsewhere is established by F16d rather than F24d. The IRAC explanation is thus
similar.</p>
        <p>An issue is whether in there were inadequate e orts to maintain
secrecy with respect to outsiders means that secrecy was not maintained.
The rule is that MeasuresOutsiders F6p (cf Deceived ). Application is
that MeasuresOutsiders applies because F10d is present, but F6p is also
present. Therefore secrecy was maintained. A second issue is whether
that the information was obtainable elsewhere means that the
information was not valuable. The rules is InfoAvailableElsewhere F6p
(Emery ). The rule applies because F16d establishes
InfoAvailableElsewhere and F6 is present. Therefore, the information was valuable.</p>
        <p>In Mason there are two issues. The rst, InfoValuable, is the what sets our
precedent for InfoAvailableElsewhere F6p. The second relates to whether there
was notice of con dentiality with both F1d and F21p present. The answer is that
there was because F1d F21p, established in Laser.</p>
        <p>In IRAC terms:
An Issue is whether that the information was obtainable elsewhere means
that the information was not valuable. The rule used by this court is
InfoAvailableElsewhere F6p. The rule applies because F26d establishes
InfoAvailableElsewhere and F6 is present. Therefore, the information
was valuable. A second issue is whether there was notice of con dentiality
where information was disclosed in negotiations and the defendant knew
the information to be con dential. The rule is F1d F21p (Laser ).
The rule applies because F1d and F21p are present. Therefore there was
notice of con dentiality.</p>
        <p>
          Whereas the explanations from [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ] begin at the top level and work
down to the decisive facts, the IRAC explanations begin with the decisive facts.
The IRAC explanations are thus very focused and do not aspire to give an
exhaustive account, dotting every `i' and crossing every 't', but instead home in
on what mattered in the particular case. As such they assume that the person
to whom the explanation will have some knowledge of the domain. A person
familiar withe logical model in Figure 2 or, better yet, the nodes of the ADF
in Table 4 will have no di culty in seeing why these points matter and how
they decide the case. This suppression of shared background to highlight the
decisive considerations was one of the original motivations for argument based
explanation [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. For those who need or want a fuller explanation, a dialogue
seeking summary information in the manner of [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] can be initiated. Thus asking
SO? will display the parent node of the issue and asking WHY ? will display a
child node.
        </p>
        <p>Thus for Bribed asking SO? for the rst issue will produce Secrecy was
Maintained. Asking SO? again will produce The Information was a Trade Secret. A
third SO? will produce The Trade Secret was Misppropriated. Now a series of
WHY? s will produce The Information Was Misapproriated, There Was
Wrongoing, There was an Illegal Act and nally The Information Was Obtained by
Deception. Of course the users may stop the ow of information when they have
enough to see the correctness of the solution.
5.2</p>
      </sec>
      <sec id="sec-5-2">
        <title>The Boeing Company v. Sierracin Corporation, 108 Wash.2d 38, 738 P.2d 665 (1987)</title>
        <p>We will now give a full example, using Boeing 7. Boeing is a very well known
aircraft manufacturer. They do not, however, make all the parts themselves, but
sub-contract certain components. One such component was the 7/7/7 cockpit
windows. Five of these windows lie on each side of the aircraft's nose, each
performing multiple critical functions such as defogging, withstanding cabin
pressurisation, and providing a clear range of vision. The three major suppliers of
aircraft windows in the United States are PPG Industries, Inc.; Swedlow, Inc.;
and Sierracin. Sierracin had supplied Boeing with other products for many years.
Boeing's drawings for the 7/7/7 cockpit windows are unique, detailed blueprints
containing approximately 500 critical tolerances, dimensions, speci cations and
material requirements. Boeing helped Sierracin enter the 7/7/7 window market
by providing Sierracin with FAA authorized drawings, technical assistance and
tooling, and by awarding it contracts for some of Boeing's 7/7/7 window needs
in 1982 and 1983.</p>
        <p>In 1984 after alleged breaches of contract because of late deliveries of
windows, Boeing chose not to renew contracts with Sierracin, and instead signed
a 5-year 100 percent requirements contract with PPG Industries, Inc. Sierracin
decided, however, to continue manufacturing windows for sale on its own in the
7/7/7 \after market" (i.e., spare parts market). As a supplier, Sierracin received
Boeing's requests for quotations, which provided that all orders were subject to
its con dential terms and conditions. Boeing alleged that Sierracin
misappropriated its trade secrets concerning the design of aeroplane windows.</p>
        <p>Sierracin signed over 270 contracts with Boeing, each containing the
following language: \Con dential Disclosure. Seller shall keep con dential . . . all
proprietary information".</p>
        <p>The defence was that the information was not a trade secret because it had
been disclosed to outsiders (F10d) and had not been misappropriated because it
had been disclosed to Sierracin in negotiations (F1d). This was countered by the
explicit con dentiality agreement that Boeing required suppliers to sign (F12p),
7 The description of the case is based on the opinion of Justice Dore, available at
https://casetext.com/case/boeing-company-v-sierracin-corporation.
and that Sierracin were well aware of the con dential nature of the information
(F21p). The court found for Boeing.</p>
        <p>The explanation based on the above proposal would look like this:</p>
      </sec>
      <sec id="sec-5-3">
        <title>The Boeing Company v. Sierracin Corporation, 108 Wash.2d 38, 738 P.2d 665 (1987).</title>
        <p>The decision is for the plainti . There are two issues:
1. Whether adequate measures with respect to outsiders were taken
when the information was disclosed to outsiders, but these
disclosures were restricted. The rule is Secrets-Disclosed-Outsiders
OutsiderDisclosures-Restricted (Trandes Corp. v. Guy F. Atkinson Co., 996
F.2d 655 (4th Cir.1993)). The rule applies because F10d and F12p
are present. Therefore, adequate measures with respect to outsiders
were taken.
2. Whether there was notice of con dentiality when the information
was disclosed in negotiations, but the defendant knew that the
information was con dential. The rule is Disclosure-In-Negotiations</p>
        <p>Knew-Info-Con dential (Laser Industries,Ltd. v. Eder Instrument
Co., 573 F.Supp. 987 (1983)). The rule applies because F1d and F21p
are present. Therefore, there was notice of con dentiality,</p>
        <p>The user may now interrogate the system further to help in understanding
why these issues matter.</p>
        <sec id="sec-5-3-1">
          <title>Issue 1: So?</title>
          <p>Reply 1: Secrecy was Maintained (Restatement of Torts section 757,
comment(b), bullet 3).</p>
          <p>Reply 1: So?
Reply 2: The information was a Trade Secret (Restatement of Torts
section 757, comment(b).</p>
          <p>Reply 2: Why?
Reply 3: The information was valuable. (Restatement of Torts section
757, comment(b), bullet 3).</p>
          <p>Reply 3: Why?
The issue was unopposed. Further the product was unique (F15p).
Satis ed as to Issue 1, the user now turns to issue 2.</p>
        </sec>
        <sec id="sec-5-3-2">
          <title>Issue 2: So?</title>
          <p>Reply 4: There was a Con dential Relationship (Restatement of Torts,
section 757(b).</p>
          <p>Reply 4: So?
Reply 5: The Information Was Misappropriated (Restatement of Torts,
Section 757, General Principle).</p>
          <p>OK</p>
          <p>Since the user knows that the plainti should win if the information was a
trade secret and misappropriated, the dialogue is terminated here.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Discussion</title>
      <p>
        In this section we will consider three points that arise from the foregoing: the
quality of the explanations; the implications for accounts of precedential
constraint; and how to accommodate dimensional facts.
In his illuminating survey on explanation [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ], Miller identi es four features of
good explanations. These are:
{ Explanations are contrastive. As well as explaining why a particular classi
cation is appropriate, a good explanation will also say why other classi
cations are not.
{ Explanations are selective. Rarely is a logically complete explanation
provided, but rather only the most salient points are presented unless more
detail is required by the recipient of the explanation. The assumption is that
there will be a considerable degree of shared background knowledge, and so
the explanation need only point to some fact or rule as yet unknown to the
recipient.
{ Explanations are rarely in terms of probabilities. Using statistical
generalisations to explain why events occur is unsatisfying since they do not explain
the generalisation itself. Moreover, the explanation typically applies to a
single case, and so would require some explanation of why that particular case
is typical.
{ Explanations are social. Explanations involve a transfer of knowledge,
between particular people in a particular situation and so are relative to the
explainer's beliefs about the explainee's beliefs.
      </p>
      <p>
        The explanations produced by using issues as described above have these
features. The explanation is contrastive because it begins with the issue which
will include a factor for the other side, and so suggest why the decision would
have gone otherwise had the preferred factor for the winning side not been
present. They are selective because they begin by stating the particular reason
for the decision, and o ers any further explication of the background knowledge
explaining exactly why this matters only on request. Like most explanations in
law, no probabilities are used: speci c precedents are used to justify the rules
rather than some degree of support as in, for example, association rule mining
[
        <xref ref-type="bibr" rid="ref50">50</xref>
        ]. Finally the explanation is social in that it adopts a form of explanation
(IRAC) that is widely used in the legal community which transfers knowledge
in a way tailored to the situation and the user. The particular strength of the
proposed method is perhaps its selectivity, which contrasts with the dialogue
proposed in [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ] which included all available arguments and objections, and the
explanations in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] which again covered every aspect without regard as
to what the user might already know.
6.2
      </p>
      <sec id="sec-6-1">
        <title>Implications for Precedential Constraint</title>
        <p>
          The increased e ectiveness of formal characterisations of precedential
constraint when applied at the issue level rather than at the whole case level was
discussed in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. A problem with the results model was that, given, the large,
number of factors, there are so many possible case descriptions (226) that it is
all too easy to avoid the constraint of a precedent by pointing to a
distinguishing factor. The use of the reason model alleviates this problem to some extent,
but far from completely, as illustrated in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. However, the number of possible
case descriptions at the issue level is greatly reduced. Examination of Table 4
shows that no node has more than ve children and so no node would require
more than 32 cases to be fully resolved. Many of the nodes would require fewer:
MeasuresOutsiders, measures for example has only two children, so that there
are only four distinct case descriptions. Actually only three of these are
possible, since F12p (restrictions placed on outsider disclosures) cannot be present
without F10d (disclosures to outsiders). Also some precedents can be used for
several nodes: the cases of MeasuresOutsiders required in MaintainSecrecy can
also be used to resolve MeasuresOutsiders itself. This being so, fewer than 150
precedents would be required to resolve the tree completely, even on the results
model. This number could be substantially reduced using the reason model.
Since IBP [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] used over 180 cases, it would seem that this might be a feasible
way of addressing the problem. Moreover, various Machine Learning approaches
use even bigger datasets: over 15,000 were available to [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. If we have a dataset
already available in a form in which factors can be straightforwardly ascribed
- as might be expected when decisions are made on the basis of an application
form, which is common in elds such as welfare bene ts - or we have a machine
learning program which ascribes factors as in [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], we can apply this approach
if we can associate these factors with issues. This should enable us to learn the
acceptance conditions for the nodes using a variety of ML techniques, including
such traditional techniques as rule induction [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ].
        </p>
        <p>The above suggests that whether we are using precedents for explanation or
for learning, they are best considered in terms of issues rather than as whole
cases.</p>
      </sec>
      <sec id="sec-6-2">
        <title>Factors With Magnitude</title>
        <p>
          The above presents a rather sanguine view of the possibility of predicting
legal decisions, suggesting that a couple of hundred cases should enable the
identi cation of a set of rules that would give complete accuracy. Leaving aside
the many problems with any approach predicting legal decisions on the basis of a
set of past cases, including that the law is constantly evolving so that predictions
based on old data become unreliable [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ] and that any collection of precedents is
likely to contain decisions that were biased or incorrect, there is another serious
problem. The above has assumed that, as in [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], factors are either present or
absent, and can be ascribed to cases unequivocally. In practice, however, this is
not so. Consider the Restatement of Torts:
        </p>
        <p>Some factors to be considered in determining whether given information
is one's trade secret are: (1) the extent to which the information is
known outside of his business; (2) the extent to which it is known by
employees and others involved in his business; (3) the extent of measures
taken by him to guard the secrecy of the information; (4) the value of
the information to him and to his competitors; (5) the amount of e ort
or money expended by him in developing the information; (6) the ease
or di culty with which the information could be properly acquired or
duplicated by others. Emphasis mine.</p>
        <p>
          From this it is clear than many of the aspects are not simply present or
absent, but are present or absent to some degree and so require some judgement
as to whether they were present to a degree su cient to permit the ascription of
the factor. It should be remembered that the factors used in CATO derive from
the dimensions proposed in HYPO ([
          <xref ref-type="bibr" rid="ref44">44</xref>
          ] and [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]). Dimensions were aspects of a
case which could, if applicable, take a range of values which would increasingly
favour a particular party. The relationship between dimensions and factors is
discussed in [
          <xref ref-type="bibr" rid="ref45">45</xref>
          ] and [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. In fact, in HYPO, ten of the thirteen dimensions
could take only two values and so either were inapplicable or favoured one of the
parties. For example, the bribery either favoured the plainti if bribery had taken
place, or was inapplicable. It therefore maps straightforwardly to a single factor,
F2p. Three of the dimensions did, however, span a rage of values. Competitive
Advantage was either inapplicable, neutral, or favoured the plainti , mapping to
F8p. Disclosures to Outsiders was inapplicable if there had been no disclosures,
or favoured the defendant if there had been su cient disclosures (F10d) and
neutral otherwise. Note, however, that extreme pro-defendant values on this
dimension gave rise to the the more powerful factor F27d when the information
was considered in the public domain. This is important because a plainti factor
might be preferred to F10d, but not F27d. This is true of F6p in Table 4. The
most interesting dimension is security measures. At one end this favours the
defendant and so maps into F19d, whereas at the other it maps into F6p and
favours the plainti . It is thus always applicable. Many cases, however, contain
neither F19d nor F6p, suggesting that the middle of the range is neutral so that
no factor is applicable. Note that where a dimension can favour both sides, two
distinct factors are used: this is because in general the absence of factor is not a
reason to decide for the other side. The was explained by Rissland and Ashley
in [
          <xref ref-type="bibr" rid="ref45">45</xref>
          ]:
[...] the Security-Measures dimension was broken into two factors:
SecurityMeasures [F6p], favoring the plainti , and No-Security-Measures [F19d],
favoring the defendant. This was done because judges explicitly said
that the fact that plainti had taken no security measures was a positive
strength for the opponent. By contrast, Ashley and Aleven did not create
a \No-Secrets-Disclosed-Outsiders" factor because they found no cases
where judges had said that the absence of any disclosures to outsiders
was a positive strength for the plainti . ([
          <xref ref-type="bibr" rid="ref45">45</xref>
          ], p 69).
        </p>
        <p>
          Most of the CATO factors derive from two valued dimensions and so can be
considered either present or absent, and so do not require special consideration.
The three factors deriving from dimensions with ranges of value, however, do
need something more. Horty in [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] and [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] introduced the notion of factors
with magnitude, and discussed how these could be accommodated in a theory
of precedential constraint. Rigoni addressed this problem in [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ], and Horty
modi ed his approach in [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]. A comparison of their approaches is given in [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ].
Although this was taken in [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ] to imply that precedential constraint should be
expressed in terms dimensions rather than factors, it was argued in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] that
this is perhaps not the best approach. We will explain how we can accommodate
dimensions in an account of precedential constraint based on factors.
        </p>
        <p>
          Many have seen reasoning with legal cases as a two stage process: rst factors
are assigned on the basis of the facts in a cases, and then these factors are
considered in the the light of precedent cases to see whether the decision is
constrained. This two stage approach is described in [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ]
        </p>
        <p>
          Once the facts of a case have been established - and this is rarely
straightforward since the move from evidence to facts is often itself the subject of
debate - legal reasoning can be seen, following Ross [
          <xref ref-type="bibr" rid="ref46">46</xref>
          ] and Lindhal and
Odelstad [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ], as a two stage process, rst from the established facts to
intermediate predicates, and then from these intermediate predicates to
legal consequences. CATO has been explicitly identi ed with the second
of these steps (e.g. [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]). ([
          <xref ref-type="bibr" rid="ref41">41</xref>
          ], p 22).
        </p>
        <p>
          This approach has been used not only in [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ], but also in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and further
advocated in [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] and [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <p>
          If we adopt this two stage model, we can see factors with magnitude as factors
deriving from a dimension with more than two values, so that it may possibly
favour either of the two sides, like Security Measures which leads to F6p and
F19d. It may, like Security Measures, have a neutral area in which no factor
is applicable, or, like disclosures, give rise to two factors favouring the same
side with di erent strengths, as with F10p and F27p. Now we must determine
which factor, if any, should be ascribed in a particular case given that it lies at
a certain point on the range (termed by Horty a dimensional fact ). This can
be determined by precedents using either the results model or the reason model
[
          <xref ref-type="bibr" rid="ref28">28</xref>
          ]. Rigoni proposed that precedents should be regarded as identifying switching
points on the dimensions, the points at which factors come to be, and cease to
be, applicable. The fact that whether a factor is applicable or not is itself be
debatable, complicates the rst stage of the process. However, once the set of
applicable factors has been identi ed, the second stage can proceed as described
above.
        </p>
        <p>
          Another, perhaps more serious, problem is that these factors may not be
independent. For example, cases arise which require balancing the interests of
the state in enabling the enforcement of laws with the privacy interests of its
citizens [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. In such cases it may seem necessary to trade o one factor against
another, so that the more serious the suspected crime the greater the intrusion
on privacy that is justi ed. Such balancing of interests has been discussed in [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ]
and [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. We would, however, in line with the two stage approach, follow [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]
and see the question not as a balance between factors, but as a question of the
ascription of factors on the basis of dimensional facts, so that factors themselves
can continue to be seen as independent.
        </p>
        <p>
          The example in [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] concerns change of scal domicile. Among other things
to be considered are the length of stay abroad and the percentage of income
earned abroad. The longer the absence and the greater the amount, the more
change is favoured. We may now have a decision where an absence of 36 months
and earnings of 60% favoured change, while an absence of 48 months but only
20% earnings favoured no change. This suggests that absence and income are
not independent, but trade o against each other. Suppose we have a third case
also with 20% earnings, but an absence of 60 months, further indicating the
existence of a trade o .
        </p>
        <p>
          The suggestion in [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] is to introduce a factor ascribed to the case on the basis
of the dimensional facts recording absence and income. In this case a suitable
factor would be IncomeSu cientGivenAbsence and would favour change. Each
precedent for change will block o an area where the factor de nitely applies,
and each precedent for the defendant will block o an area where the factor
de nitely does not apply. This is shown in Figure 3. We can now t a line to the
points and suggest that the factor applies to points north east of the line and
does not apply to points south west of the line. A possible line (y = 120 10x:
designed to just include both precedents) is shown in Figure 3. Of course, other
lines are possible, and the function need not be linear, and so any unconstrained
point may be the subject of debate as to whether or not the precedent applies.
        </p>
        <p>
          The composite factor will appear as a node in the ADF with the dimensional
facts as its children and the equation will de ne the acceptance condition. This
node can be treated as an issue for explanation purposes.
In this paper we have discussed several reasons why cases are better seen as
bundles of issues than as bundles of factors. The issues will be the bundles of
factors. Thinking in terms of issues improves explanations by enabling them
to focus on what was disputed and what is signi cant in the particular case
under consideration, and to be expressed in the IRAC form widely taught in law
schools. Using issues also greatly enhances factor based precedential constraint
by eliminating irrelevant distinctions. The importance of issues for prediction
was indicated by the central role given to issues in systems designed to predict
legal decisions based on factors such as [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] ad [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], and is discussed in detail in
[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
        </p>
        <p>Developing good factor based explanations is of current importance because
of the increased use of machine learning approaches for predicting legal decisions.
Explanations are essential because of the right to explanation and to encourage
acceptance of these predictions. But they also have relevance to the responsible
use of such systems: machine learning approaches are vulnerable to changes in
the law and social attitudes, and the bias that may exist in the past decisions.
Good explanations will help to detect decisions based on reasons which are no
longer applicable, and decisions based on reasons that exhibit bias. Explanation
can therefore apply a corrective in uence essential to the responsible use of
Machine Learning in law.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Al-Abdulkarim</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atkinson</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>A methodology for designing systems to reason with legal cases using Abstract Dialectical Frameworks</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>24</volume>
          (
          <issue>1</issue>
          ),
          <volume>1</volume>
          {
          <fpage>49</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Aletras</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsarapatsanis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Preotiuc-Pietro</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lampos</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Predicting judicial decisions of the European Court of Human Rights: A natural language processing perspective</article-title>
          .
          <source>PeerJ Computer</source>
          Science 2: DOI: 10.7717/peerj-cs.
          <volume>93</volume>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Aleven</surname>
          </string-name>
          , V.:
          <article-title>Teaching case-based argumentation through a model and examples</article-title>
          .
          <source>Ph.D. thesis</source>
          , University of Pittsburgh (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ashley</surname>
          </string-name>
          , K.D.:
          <article-title>Modeling legal arguments: Reasoning with cases and hypotheticals</article-title>
          . MIT press, Cambridge, Mass. (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ashley</surname>
            ,
            <given-names>K.D.</given-names>
          </string-name>
          , Bruninghaus, S.:
          <article-title>Automatically classifying case texts and predicting outcomes</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>17</volume>
          (
          <issue>2</issue>
          ),
          <volume>125</volume>
          {
          <fpage>165</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Atkinson</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bollegala</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Explanation in AI and Law: Past, present and future</article-title>
          .
          <source>Arti cial Intelligence</source>
          p.
          <volume>103387</volume>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>HYPO's legacy: Introduction to the virtual special issue</article-title>
          .
          <source>Articial Intelligence and Law</source>
          <volume>25</volume>
          (
          <issue>2</issue>
          ),
          <volume>1</volume>
          {
          <fpage>46</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Explaining legal decisions using IRAC</article-title>
          .
          <source>In: Computational Models of Natural Argument</source>
          <year>2020</year>
          . vol.
          <volume>2669</volume>
          , pp.
          <volume>74</volume>
          {
          <fpage>83</fpage>
          . CEUR Workshop Proceedings 2669 (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>The need for good old fashioned AI and Law</article-title>
          . In: Hotzendorfer, W.,
          <string-name>
            <surname>Tschohl</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kummer</surname>
            ,
            <given-names>F</given-names>
          </string-name>
          . (eds.)
          <article-title>International trends in legal informatics: a Festschrift for Erich Schweighofer</article-title>
          , pp.
          <volume>23</volume>
          {
          <fpage>36</fpage>
          .
          <string-name>
            <surname>Weblaw</surname>
          </string-name>
          , Bern (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atkinson</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Dimensions and values for legal CBR</article-title>
          .
          <source>In: Proceedings of JURIX 2017</source>
          . pp.
          <volume>27</volume>
          {
          <fpage>32</fpage>
          . IOS Press (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atkinson</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Precedential constraint: The role of issues</article-title>
          .
          <source>In: Proceedings of the 18th International Conference on Arti cial Intelligence and Law</source>
          . p. In Press. ACM (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coenen</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orton</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Argument-based explanation of the British Nationality Act as a logic program</article-title>
          .
          <source>Information and Communications Technology Law</source>
          <volume>2</volume>
          (
          <issue>1</issue>
          ),
          <volume>53</volume>
          {
          <fpage>66</fpage>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lowes</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McEnery</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Argument-based explanation of logic programs</article-title>
          .
          <source>Knowledge-Based Systems 4(3)</source>
          ,
          <volume>177</volume>
          {
          <fpage>183</fpage>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prakken</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Visser</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Argument schemes for two-phase democratic deliberation</article-title>
          .
          <source>In: Proceedings of the 13th International Conference on Articial Intelligence and Law</source>
          . pp.
          <volume>21</volume>
          {
          <issue>30</issue>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Branting</surname>
            ,
            <given-names>L.K.</given-names>
          </string-name>
          :
          <article-title>Reasoning with portions of precedents</article-title>
          .
          <source>In: Proceedings of the 3rd International Conference on AI and Law</source>
          . pp.
          <volume>145</volume>
          {
          <issue>154</issue>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Branting</surname>
            ,
            <given-names>L.K.</given-names>
          </string-name>
          :
          <article-title>Explanation in hybrid, two-stage models of legal prediction</article-title>
          .
          <source>In: The 3rd XAILA Workshop at JURIX</source>
          <year>2020</year>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Branting</surname>
            ,
            <given-names>L.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pfeifer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brown</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aberdeen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pfa</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liao</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Scalable and explainable legal prediction</article-title>
          .
          <source>AI and Law (Available Online</source>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Brewka</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Woltran</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Abstract Dialectical Frameworks</article-title>
          .
          <source>In: Twelfth International Conference on the Principles of Knowledge Representation and Reasoning</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. Bruninghaus,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Ashley</surname>
          </string-name>
          , K.D.:
          <article-title>Predicting outcomes of case based legal arguments</article-title>
          .
          <source>In: Proceedings of the 9th International Conference on Arti cial Intelligence and Law</source>
          . pp.
          <volume>233</volume>
          {
          <fpage>242</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Chalkidis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Androutsopoulos</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aletras</surname>
          </string-name>
          , N.:
          <article-title>Neural legal judgment prediction in English</article-title>
          . arXiv preprint arXiv:
          <year>1906</year>
          .
          <year>02059</year>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Chorley</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>An empirical investigation of reasoning with legal cases through theory construction and application</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>13</volume>
          (
          <issue>3-4</issue>
          ),
          <volume>323</volume>
          {
          <fpage>371</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Doshi-Velez</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kortz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Budish</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bavitz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gershman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>O</given-names>
            <surname>'Brien</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Schieber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Waldo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Weinberger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Wood</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Accountability of AI under the law: The role of explanation</article-title>
          .
          <source>arXiv preprint arXiv:1711.01134</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Gordon</surname>
            ,
            <given-names>T.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Walton</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Formalizing balancing arguments</article-title>
          .
          <source>In: Proceedings of COMMA 2016</source>
          . pp.
          <volume>327</volume>
          {
          <issue>338</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Grabmair</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Modeling Purposive Legal Argumentation and Case Outcome Prediction using Argument Schemes in the Value Judgment Formalism</article-title>
          .
          <source>Ph.D. thesis</source>
          , University of Pittsburgh (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Grabmair</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Predicting trade secret case outcomes using argument schemes and learned quantitative value e ect tradeo s</article-title>
          .
          <source>In: Proceedings of the 16th International Conference on Arti cial Intelligence and Law</source>
          . pp.
          <volume>89</volume>
          {
          <issue>98</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Horty</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Reasons and precedent</article-title>
          .
          <source>In: Proceedings of the 13th International Conference on Arti cial Intelligence and Law</source>
          . pp.
          <volume>41</volume>
          {
          <issue>50</issue>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Horty</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Reasoning with dimensions and magnitudes</article-title>
          .
          <source>In: Proceedings of the 16th the International Conference on Arti cial Intelligence and Law</source>
          . pp.
          <volume>109</volume>
          {
          <issue>118</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Horty</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Reasoning with dimensions and magnitudes</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>27</volume>
          (
          <issue>3</issue>
          ),
          <volume>309</volume>
          {
          <fpage>345</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Horty</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Modifying the reason model</article-title>
          .
          <source>Arti cial Intelligence and Law (Available On Line</source>
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Horty</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>A factor-based de nition of precedential constraint</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>20</volume>
          (
          <issue>2</issue>
          ),
          <volume>181</volume>
          {
          <fpage>214</fpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Kaur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bozic</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Convolutional neural network-based automatic prediction of judgments of the european court of human rights</article-title>
          .
          <source>In: 27th AIAI Irish Conference on AI and Cognitive Science</source>
          . pp.
          <volume>458</volume>
          {
          <fpage>469</fpage>
          . CEUR 2563 (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Lauritsen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>On balance</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>23</volume>
          (
          <issue>1</issue>
          ),
          <volume>23</volume>
          {
          <fpage>42</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Lindahl</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Odelstad</surname>
          </string-name>
          , J.:
          <article-title>Open and closed intermediaries in normative systems</article-title>
          .
          <source>In: Proceedings of JURIX 2006</source>
          . pp.
          <volume>91</volume>
          {
          <fpage>99</fpage>
          . IOS Press (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Medvedeva</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vols</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wieling</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Using machine learning to predict decisions of the European Court of Human Rights</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          pp.
          <volume>1</volume>
          {
          <issue>30</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Medvedeva</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vols</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wieling</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>JURI says: An automatic judgement prediction system for the European Court of Human Rights</article-title>
          .
          <source>In: Proceedings of JURIX 2020</source>
          . pp.
          <volume>277</volume>
          {
          <issue>280</issue>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Explanation in Arti cial Intelligence: Insights from the social sciences</article-title>
          .
          <source>Arti cial Intelligence</source>
          <volume>267</volume>
          ,
          <issue>1</issue>
          {
          <fpage>38</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Mozina</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zabkar</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , Bratko, I.:
          <article-title>Argument based machine learning applied to law</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>13</volume>
          (
          <issue>1</issue>
          ),
          <volume>53</volume>
          {
          <fpage>73</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Prakken</surname>
          </string-name>
          , H.:
          <article-title>A a formal analysis of some factor- and precedent-based accounts of precedential constraint</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          (Available On-Line
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Prakken</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosa</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A top-level model of case-based argumentation for explanation: formalisation and experiments</article-title>
          . Argument and
          <string-name>
            <surname>Computation (Available</surname>
          </string-name>
          On-Line
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Prakken</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sartor</surname>
          </string-name>
          , G.:
          <article-title>Modelling reasoning with precedents in a formal dialogue game</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>6</volume>
          (
          <issue>2-4</issue>
          ),
          <volume>231</volume>
          {
          <fpage>287</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <surname>Prakken</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wyner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atkinson</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>A formalization of argumentation schemes for legal case-based reasoning in ASPIC+</article-title>
          .
          <source>Journal of Logic and Computation</source>
          <volume>25</volume>
          (
          <issue>5</issue>
          ),
          <volume>1141</volume>
          {
          <fpage>1166</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <surname>Rigoni</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>An improved factor based approach to precedential constraint</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>23</volume>
          (
          <issue>2</issue>
          ),
          <volume>133</volume>
          {
          <fpage>160</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          43.
          <string-name>
            <surname>Rigoni</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Representing dimensions within the reason model of precedent</article-title>
          .
          <source>Arti - cial Intelligence and Law</source>
          <volume>26</volume>
          (
          <issue>1</issue>
          ),
          <volume>1</volume>
          {
          <fpage>22</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          44.
          <string-name>
            <surname>Rissland</surname>
            ,
            <given-names>E.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ashley</surname>
            ,
            <given-names>K.D.:</given-names>
          </string-name>
          <article-title>A case-based system for Trade Secrets law</article-title>
          .
          <source>In: Proceedings of the 1st International Conference on Arti cial Intelligence and Law</source>
          . pp.
          <volume>60</volume>
          {
          <fpage>66</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>1987</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          45.
          <string-name>
            <surname>Rissland</surname>
            ,
            <given-names>E.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ashley</surname>
          </string-name>
          , K.D.:
          <article-title>A note on dimensions and factors</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>10</volume>
          (
          <issue>1-3</issue>
          ),
          <volume>65</volume>
          {
          <fpage>77</fpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          46.
          <string-name>
            <surname>Ross</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Tu</surname>
          </string-name>
          ^
          <article-title>-tu^</article-title>
          .
          <source>Harvard Law Review</source>
          <volume>70</volume>
          ,
          <issue>812</issue>
          {
          <fpage>825</fpage>
          (
          <year>1957</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          47.
          <string-name>
            <surname>Schauer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Precedent</surname>
          </string-name>
          .
          <source>Stanford Law Review</source>
          <volume>39</volume>
          ,
          <issue>571</issue>
          {
          <fpage>605</fpage>
          (
          <year>1987</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          48.
          <string-name>
            <surname>Skalak</surname>
            ,
            <given-names>D.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rissland</surname>
            ,
            <given-names>E.L.</given-names>
          </string-name>
          :
          <article-title>Arguments and cases: An inevitable intertwining</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>1</volume>
          (
          <issue>1</issue>
          ),
          <volume>3</volume>
          {
          <fpage>44</fpage>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          49.
          <string-name>
            <surname>Varsava</surname>
          </string-name>
          , N.:
          <article-title>How to realize the value of stare decisis: Options for following precedent</article-title>
          .
          <source>Yale Journal of Law and the Humanities</source>
          <volume>30</volume>
          ,
          <issue>62</issue>
          {
          <fpage>120</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          50.
          <string-name>
            <surname>Wardeh</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coenen</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Padua: a protocol for argumentation dialogue using association rules</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          <volume>17</volume>
          (
          <issue>3</issue>
          ),
          <volume>183</volume>
          {
          <fpage>215</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          51.
          <string-name>
            <surname>Wyner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bench-Capon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Argument schemes for legal case-based reasoning</article-title>
          .
          <source>In: Proceedings of JURIX 2007</source>
          . pp.
          <volume>139</volume>
          {
          <issue>149</issue>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          52.
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grossi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verheij</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Case-based reasoning with precedent models: Preliminary report</article-title>
          .
          <source>In: Proceedings of COMMA 2020</source>
          . pp.
          <volume>443</volume>
          {
          <issue>450</issue>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>