<!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>Precedent Comparison in the Precedent Model Formalism: Theory and Application to Legal Cases?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Heng Zheng</string-name>
          <email>h.zheng@rug.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Davide Grossi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bart Verheij</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Bernoulli Institute, University of Groningen</institution>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>ILLC/ACLE, University of Amsterdam</institution>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Comparison between precedents and case facts is a core issue in case-based reasoning, which has been discussed in a lot of research. In this paper, we use a recently developed precedent model formalism to discuss precedent comparison in case-based reasoning. With this formalism and a case study in a real legal domain, we show a new generalization and a new re nement of precedent comparison with respect to case-based reasoning approaches based on factors, such as HYPO and CATO. 1) Generalization: precedents and case facts can now be compared with general propositional formulas, and not only with factors. 2) Re nement: a distinction can be made between current analogies and distinctions in precedent models, and so-called relevances, i.e., unshared formulas between two precedents that are relevant for possible additional analogies and distinctions that can arise in a discussion. With these contributions the role of factors in case-based reasoning can be re ned and compound formulas based on factors can be taken into account in casebased reasoning.</p>
      </abstract>
      <kwd-group>
        <kwd>case-based reasoning</kwd>
        <kwd>precedents</kwd>
        <kwd>precedent comparison</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Case-based reasoning, one of the main legal reasoning types, has been discussed
in the Arti cial Intelligence and Law community for years. It allows for a form
of analogical reasoning [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], and the core issue is how to make decisions for a
current case by comparing precedents, namely the doctrine of stare decisis. As
concluded by [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], there are three kinds of approaches for modeling case-based
reasoning: prototype and deformation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]; dimension and legal factor [3{7]; and
exemplar-based explanation [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. This paper follows the direction of factor-based
approaches.
      </p>
      <p>
        Case-based reasoning with factors has been formalized using many di erent
approaches. For instance, abductive logic programming[
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ], formal dialogue
games [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], context-related frameworks [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], dialectical arguments [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ],
ontologies in OWL [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], the ASPIC+ framework [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], reason models [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], abstract
argumentation [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], abstract dialectical frameworks [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and case-based
argumentation frameworks [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. These works often discuss precedent comparison in
terms of factors, following ideas developed in HYPO [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ].
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], a new formalism on modeling case-based reasoning has been
discussed in a formal logical language. It can be used for evaluating the validity of
arguments in legal reasoning. These models are based on the case model
formalism [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], which has been implemented in a Prolog program [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. The precedent
models we present in that paper represent precedents as conjunctions of factors
and outcomes. In our approach, factors are meant to represent generalized case
facts relevant to the outcome of the case decision. However, unlike in CATO
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], our use of factors does not assume that factors favor a side of the decision,
either pro-plainti or pro-defendant, as such an assumption is not needed for
our logical de nitions of precedent comparison. Unlike HYPO [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], our factors do
not come with a dimension that can express a magnitude.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], we show that precedents can be compared through the preference
relation in precedent models, however, that paper only brie y mentions precedent
comparison in the form of case-based reasoning, which is the focus of the present
paper. In Section 2, we show the technical aspect of comparing precedents with
our formalism which can compare precedents not only in terms of shared factors,
but also in terms of other, more general shared propositional formulas, as also
presented in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. The present paper is an extension of [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], we continue our
discussion by applying our approach to HYPO-style comparison in terms of factors
(Section 3.1), and discussing the approach in the context of a real legal domain
(Section 3.2). We generalize case-based reasoning by comparing precedents with
general formulas and re ne case-based reasoning by introducing the new notion
of relevances (Section 2.2). In this way, we show that comparing precedents with
respect to general properties, represented by general propositional formulas,
offers a novel angle on case-based reasoning.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>The precedent model formalism</title>
      <p>
        In this section, we present the precedent model formalism and apply it to
precedent comparison in case-based reasoning (also shown in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]). The precedent
models de ned in Section 2.1 are based on the case models formalism addressed
by Verheij [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Precedent comparison is based on the analogies and distinctions
de ned in the case models [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
2.1
      </p>
      <sec id="sec-2-1">
        <title>Precedents and precedent models</title>
        <p>The formalism introduced in this paper uses a propositional logic language L
generated from a set of propositional constants. We x language L. We write :
for negation, ^ for conjunction, _ for disjunction, $ for equivalence, &gt; for a
tautology, and ? for a contradiction. The associated classical, deductive, monotonic
consequence relation is denoted .</p>
        <p>Precedents consist of factors and outcomes. As explained in the
introduction, our use of factors is related to but di ers from other uses of factors in
the literature, and we do not assume that factors favor a side since that is not
necessary for our focus of logical precedent comparison. We consider both
factors and outcomes are literals. A literal is either a propositional constant or its
negation. We use F L to represent a set of factors, O L to represent a
set of outcomes. The sets F and O are disjoint and consist only of literals. If
a propositional constant p is in F (or O), then :p is also in F (respectively in
O). A factor represents an element of a case, namely a factual circumstance. Its
negation describes the opposite fact. For instance, if a factor ' is \A kills B",
then its negation :' is \A does not kill B". An outcome always favors a side in
the precedent, its negation favors the opposite side. For instance, an outcome !
is \A is guilty", its negation :! is \A is not guilty".</p>
        <p>Following existing work in case-based reasoning, a precedent is a logical
consistent conjunction of factors and outcomes. If a precedent contains an outcome,
then we say it is a proper precedent. If a precedent doesn't have any outcome,
then it is a situation that describes a current case. The outcomes of these
situations need to be decided upon.</p>
        <p>De nition 1 (Precedents). A precedent is a logically consistent conjunction
of distinct factors and outcomes = '0 ^ '1 ^ : : : ^ 'm ^ !0 ^ !1 ^ : : : ^ !n 1,
where m and n are non-negative integers. We say that '0; '1; :::; 'm are the
factors of , !0; !1; :::; !n 1 are the outcomes of . If n = 0, then we say that
is a situation with no outcomes, otherwise is a proper precedent.
Notice that both m and n can be equal to 0. When m = 0, there is one single
factor. When n = 0, the precedent has no outcome and the empty conjunction
!0 ^ : : : ^ !n 1 is equivalent to &gt;. We do not assume precedents are complete
descriptions. That is, factors may exist which do not occur in the precedent.
Furthermore, we do not assume that the negation of a factor holds when the
factor does not occur in the precedent.</p>
        <p>
          Example 1. Assume sentences 0; 1 2 L are two precedents. 0 = f1 ^f2 ^f3 ^o,
1 = f1 ^ :f2 ^ :o. f1; f2, :f2 and f3 are factors, o and :o are outcomes.
Precedents can be compared through the preference relation between precedents
in precedent models, which has been discussed in [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. A precedent model is a
set of logically incompatible precedents forming a total preorder representing a
preference relation among the precedents.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>De nition 2 (Precedent models). A precedent model is a pair (P; ) where</title>
        <p>P is a set of precedents such that for all ; 0 2 P with 6= 0, ^ 0 ?; and
is a total preorder over P .</p>
        <p>As customary, the asymmetric part of is denoted &gt;. The symmetric part of
is denoted . Let , 0 be two precedents, 0 means is at least as
preferred as 0; &gt; 0 means is more preferred than 0; and 0 means
is as preferred as 0.</p>
        <p>Example 2. Following Example 1, we assume 0 is more preferred than 1. In a
precedent model with only precedents 0 and 1, the preference relation of this
model is 0 &gt; 1.
2.2</p>
      </sec>
      <sec id="sec-2-3">
        <title>Comparing precedents in the formalism</title>
        <p>Notions of comparing precedents in case-based reasoning include analogies,
distinctions and relevances, they are related to general formulas, not only the
factors or outcomes. Analogies between two precedents are the formulas that follow
logically from both two precedents. Distinctions are the unshared formulas
between two precedents, that only follow logically from one of the precedents and
its negation is logically implied by the other precedent. Relevances are the
unshared formulas between two precedents, that are relevant to the analogies and
distinctions between them. These formulas only follow from one of the
precedents, but both themselves and their negation are not logically implied by the
other one.</p>
        <p>De nition 3 (Analogies, distinctions and relevances). Let ; 0 2 L be
two precedents, we de ne:
1. a sentence 2 L is an analogy between and 0 if and only if and
0 . A most speci c analogy between and 0 is an analogy that logically
implies all analogies between and 0.
2. a sentence 2 L is a distinction in with respect to 0 ( - 0 distinction) if
and only if and 0 : . A most speci c - 0 distinction is a distinction
that logically implies all - 0 distinctions.
3. a sentence 2 L is a relevance in with respect to 0 ( - 0 relevance) if
and only if , 0 6 and 0 6 : . is a proper - 0 relevance if and
only if is a - 0 relevance that logically implies the most speci c analogy
between and 0. A most speci c - 0 relevance is a relevance that logically
implies all - 0 relevances.</p>
        <p>Both - 0 distinctions and 0- distinctions are called the distinctions between
and 0. Both - 0 relevances and 0- relevances are called the relevances
between and 0. When a most speci c analogy/distinction/relevance exists it is
by de nition unique, and we can refer to it as the most speci c
analogy/distinction/relevance.</p>
        <p>Example 3. Following Example 1, we have:
{ Analogies between 0 and 1: e.g., f1, f1 _ f2, f1 _ f3;
{ 0- 1 distinctions: e.g., f2, f2 ^ o, f2 _ :f1;
{ 0- 1 relevances: e.g., f3, f2 _ f3;
{ Proper 0- 1 relevances: e.g., f1 ^ f3 ^ (:o _ f2) ^ (:f2 _ o).</p>
        <p>Now we further discuss notions in De nition 3. Figure 1 illustrates analogies,
distinctions and relevances using Venn diagrams representing sets of worlds in
which sentences are true. As shown in Figure 1, for any analogy between
precedents and 0, the sets of and 0 worlds are subsets of the set of
Analogy
- 0 distinction</p>
        <p>- 0 relevance
and 0
0
0</p>
        <p>0
and 0 :
; 0 6 and 0 6 :
worlds; for any - 0 distinction , the worlds are a subset of the worlds,
while the 0 worlds and the worlds are disjoint; for any - 0 relevance , the
worlds are a subset of the worlds, while the 0 worlds and the worlds are not
subsets of each other and the intersection of the 0 worlds and the worlds are
always not empty. The following proposition shows the properties of analogies,
distinctions and relevances between precedents.</p>
        <p>Proposition 1. Let ; 0 2 L be precedents. Then the following holds:
1. The most speci c analogy between and 0 always exists and is logically
equivalent to _ 0;
2. There exists a distinction between and 0 if and only if ^ 0 ?; If a
- 0 distinction exists, then the most speci c - 0 distinction exists and is
logically equivalent to ;
3. The most speci c - 0 relevance does not always exist;
4. If the most speci c - 0 distinction exists, then the most speci c - 0
distinction logically implies each proper - 0 relevance. Each proper - 0 relevance
logically implies the most speci c analogy between and 0.</p>
        <p>Proof. Let ; 0 2 L be precedents. For Property 1, by De nition 3, for any
analogy , and 0 . By propositional logic it follows that any analogy
is logically implied by _ 0. By De nition 3, _ 0 is therefore a most speci c
analogy.</p>
        <p>For Property 2, assume a - 0 distinction exists. By De nition 3,
and 0 : . It follows by propositional logic that ^ 0 ?. If ^ 0 ?,
then by propositional logic 0 : . By De nition 3 and propositional logic,
is therefore the most speci c - 0 distinction.</p>
        <p>For Property 3, assume language L is generated from a set of propositional
constants ff1; f2g. If = f1, 0 = :f1, the most speci c - 0 relevance does
not exist. - 0 relevances like f1 _ f2, f1 _ :f2 cannot be logically implied by a
unique - 0 relevance.</p>
        <p>For Property 4, by Property 2 if the most speci c - 0 distinction exists,
then it is logically equivalent to . By De nition 3, logically implies all - 0
relevances, including proper ones, and proper - 0 relevances always logically
imply the most speci c analogy between and 0.</p>
        <p>As shown in Proposition 1, _ 0 is always the most speci c analogy between
and 0. In legal case-based reasoning, the most speci c analogy between two
precedents we de ne here may seem to be counterintuitive. However, as the
de nition of precedent comparison is based on propositional logic, _ 0 is the
only sentence that can logically imply all the analogies between two precedents.</p>
        <p>The most speci c - 0 distinction is logically equivalent to if it exists.
From the perspective of case-based reasoning with factors, such as HYPO, it is
odd that the precedent itself is a distinction, but notice that here we represent
precedents as conjunctions of factors and outcomes, hence precedents themselves
can be considered as a formula. Since precedent comparison we de ne in this
section aims at comparing all formulas in precedents, in this sense, we can say
the precedent itself, as a propositional formula, is the most speci c distinction.</p>
        <p>Property 4 in Proposition 1 shows why we have singled out proper relevances:
in the formally precise sense of the proposition, they are logically `in between'
the most speci c distinction (if it exists) and the most speci c analogy.</p>
        <p>
          The following corollary shows a property of precedents in precedent models.
Corollary 1. Let (P; ) be a precedent model, for all
speci c - 0 distinction always exists.
and 0 2 P , the most
Proof. The corollary follows from De nition 2 and Property 2 of Proposition 1.
Two precedents can be compared with a third precedent using the analogy
relation de ned below, which is similar to what is called on-pointness in HYPO [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
The analogy relation is based on the shared formulas between precedents. When
comparing precedents and 0 in terms of precedent 00, if the most speci c
analogy between and 00 logically implies the most speci c analogy between
0 and 00, then we say that is at least as analogous as 0 with respect to 00.
Formally we de ne the analogy relation as follows.
        </p>
        <p>De nition 4 (Analogy relation between precedents). Let , 0 and 00 2
L be precedents. We de ne:</p>
        <p>00 0 if and only if _ 00 0 _ 00.</p>
        <p>Then we say is at least as analogous as 0 with respect to 00.
As customary, the asymmetric part of the relation is denoted as 00 0, which
means is more analogous than 0 with respect to 00. The symmetric part of
the relation is denoted as 00 0, which means is as analogous as 0 with
respect to 00. If it is not the case that 00 0 and 0 00 , then we say
and 0 are analogously incomparable with respect to 00.</p>
        <p>Example 4. Comparing 0 and 1 in Example 1 in terms of precedent 2 =
f1 ^ f2, we have 0 2 1; If 2 = f1 ^ :f2, then we have 1 2 0; If
2 = f1, then we have 0 2 1; If 2 = :f3, then 0 and 1 are analogously
incomparable with respect to 2.</p>
        <p>Proposition 2. Let , 0 and 00 2 L be precedents. Then the following holds:
1. The analogy relation is re exive and transitive, hence a preorder;
2. 00 0 if and only if 0 _ 00;
3. If 00 0, then 0 00 and vice versa;
4. For any 2 L, if 00 0, and is an analogy between 0 and 00, then
is also an analogy between and 00.</p>
        <p>Proof. For property 1, the analogy relation is re exive, since _ 00 _ 00. The
relation is also transitive because of the transitivity of entailment in propositional
logic. Assume = f1 ^ f2, 0 = f1 ^ f3 and 00 = f1 ^ f2 ^ f3, and 0 are
analogously incomparable with respect to 00, hence the relation is not in general
total.</p>
        <p>For Property 2, from left to right, by De nition 4 we obtain _ 00 0 _ 00,
and by propositional logic 0 _ 00. From right to left, from 0 _ 00 and
propositional logic, we obtain _ 00 _ 00, and by De nition 4 00 0.</p>
        <p>Property 3 then follows directly from Property 2 by the commutativity of _.</p>
        <p>Property 4 follows directly from De nition 3 and 4.</p>
        <p>Notice that if 00 0, then it is still possible that 6 0 and 6 00. For
instance, if = f1, 0 = f1 ^ f2, 00 = f1 ^ :f2, then we have 00 0, but both
0 and 00 are not logically implied by . Also notice that if 00 0, it cannot
be concluded that 0. For instance, = f1 ^ f2, 0 = f3 and 00 = f1. In this
example, 00 0 but f1 ^ f2 6 f3.
3</p>
        <p>Application: HYPO in the precedent model formalism
In this section, we formalize notions of comparison in HYPO with the precedent
model formalism, and discuss them by a case study in a real legal domain. Factors
in our approach are di erent from similar notions in HYPO (as dimensions) and
CATO (as binary factors), which always favor a speci c outcome.
3.1</p>
      </sec>
      <sec id="sec-2-4">
        <title>Formalizing notions of comparison in HYPO</title>
        <p>We assume that all factors in F favor a speci c outcome in O, and O = f!; :!g,
where ! stands for an outcome that one of the parties in the court wins the
claim, :! stands for the other party winning the claim. F = F! [ F:!, such
that for all ' 2 F , if ' 2 F!, then :' 2 F:! and vice versa. F! stands for the
factors that support outcome !, F:! stands for the factors against outcome !,
namely supporting outcome :!.</p>
        <p>In HYPO, shared factors between two cases are called relevant similarity,
while the unshared factors are called relevant di erence. Unshared factors can
be used for pointing out the two cases should be decided di erently. When
comparing two precedents in terms of a current situation, HYPO always makes sure
that the precedents are on point to the situation, namely they share at least one
factor. If a precedent shares more factors with the situation than a second one,
then this precedent is more on point than second with respect to the situation.</p>
        <p>Let ; 0 and 00 be precedents, ! 2 O be an outcome of 0. Notions related
to HYPO-style comparison can be formalized by the precedent model formalism
as follows:
1. Relevant similarity s 2 L is the relevant similarity between and 0 if and
only if s is the conjunction of all the factors that are analogies between
and 0.
2. Relevant di erence against ! in 0 d 2 L is the relevant di erence against
! in 0 between and 0 if and only if d is the conjunction of all the factors
' that are distinctions or relevances between and 0, such that:
(a) if ' is a - 0 distinction or - 0 relevance, then ' 2 F:!; and
(b) if ' is a 0- distinction or 0- relevance, then ' 2 F!.
3. On pointness Precedents is on point to 0 if and only if the relevant
similarity between and 0 is not an empty conjunction. Assume s 2 L is
the relevant similarity between precedents and 00, s0 2 L is the relevant
similarity between precedents 0 and 00, is more on point than 0 with
respect to 00 if and only if both and 0 are on point to 00 and s s0,
s0 6 s.</p>
        <p>Comparing with the notions de ned in De nition 3, the relevant similarity
between precedents is always an analogy between them, since the conjunction of
factors as the relevant similarity can be logically implied by both of them.
However, the relevant di erence can not be simply equal to distinctions or relevances
between precedents.</p>
        <p>Notice that in on pointness, only factors are compared and there is no
outcome involved in the comparison, however, in the analogy relation, both
factors and outcomes are taken into account. Therefore, if precedent is more on
point than precedent 0 with respect to precedent 00, then it is not always that
00 0. For instance, if = f1 ^ f2 ^ o, 0 = f1 ^ :o and 00 = f1 ^ f2 ^ f3,
then it is obviously that is more on point than 0 with respect to 00. However,
since 6 0 _ 00, is not more analogous than 0 with respect to 00, and 0
are analogously incomparable with respect to 00.
3.2</p>
      </sec>
      <sec id="sec-2-5">
        <title>Case study</title>
        <p>
          In this section, we use an example from a real legal domain to discuss precedent
comparison introduced in Section 2.2 with notions of comparison in HYPO and
comparison with preference relation in precedent models. This example has also
been discussed in [
          <xref ref-type="bibr" rid="ref1 ref20">1, 20</xref>
          ].
        </p>
        <p>Let (P; P P ) be a precedent model containing two precedents (the Yokana
case3 and the American Precision case4). Notice that P P denotes the trivial
preference relation where all precedents are as preferred as each other. The
current situation is adapted from the Mason case5. We suppose outcome ! 2 O
is logically equivalent to Pla. As shown in Figure 2, Yokana favors defendant
(:Pla) and American Precision favors plainti (Pla).</p>
        <p>When comparing Mason with Yokana in (P; P P ) according to the notions
in HYPO, we have:
3 Midland-Ross Corp. v. Yokana, 293 F.2d 411 (3rd Cir.1961)
4 American Precision Vibrator Co. v. National Air Vibrator Co., 764 S.W.2d 274
(Tex.App.-Houston [1st Dist.] 1988)
5 Mason v. Jack Daniel Distillery, 518 So.2d 130 (Ala.Civ.App.1987)</p>
        <p>Precedent model
American Precision</p>
        <p>Yokana</p>
        <p>Situation</p>
        <p>Mason
F7 ^ F16 ^ F21 ^ Pla</p>
        <p>F7 ^ F10 ^ F16 ^ :Pla</p>
        <p>F1 ^ F6 ^ F15 ^ F16 ^ F21
Factors supporting plainti 's claim: F6, F7, F15, F21</p>
        <p>Factors supporting defendant's claim: F1, F10, F16
{ The relevant similarity between Mason and Yokana: F16;
{ The relevant di erence between Mason and Yokana against :Pla in Yokana:</p>
        <p>F6 ^ F15 ^ F21 ^ F10.</p>
        <p>When comparing Mason with Yokana through the notions in Section 2.2:
{ Analogies between Yokana and Mason: e.g., F16, F16 _ F21;
{ The most speci c analogy between Yokana and Mason: (F7 ^ F10 ^ F16 ^
:Pla) _ (F1 ^ F6 ^ F15 ^ F16 ^ F21).
{ Mason-Yokana relevances: e.g., F6 ^ F15 ^ F21, F1 ^ F21;
{ Yokana-Mason relevances: e.g., F10, F16 ^ :Pla;
{ There is no distinction between Mason and Yokana, as they are not
incompatible.</p>
        <p>When comparing American Precision and Yokana in (P; P P ) in terms of
Mason, American Precision is more on point than Yokana with respect to Mason,
however, American Precision and Yokana are analogously incomparable with
respect to Mason.</p>
        <p>According to di erent comparison relations (preference relation/analogy
relation/on pointness), the selection of better precedent can be di erent. Notions
in HYPO can be well-de ned with the precedent model formalism. The analysis
also shows that HYPO-style precedent comparison is di erent from the
comparison in Section 2.2. We will further discuss these points in Section 4.
4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Discussion and conclusion</title>
      <p>
        In this paper, we discuss precedent comparison in case-based reasoning with the
precedent model formalism, which is described in a formal propositional logic
language. Unlike other case-based reasoning models, in which precedents are
represented as dimensions [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], sets of rules [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], sets of factors [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], combinations
of rules, facts and outcome [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] and hierarchies [
        <xref ref-type="bibr" rid="ref18 ref6">6, 18</xref>
        ]. The formalism we present
here represents precedents and current situations with conjunctions of factors
and outcomes. Comparing with the case model formalism in [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], we give a more
concrete account of precedents. The representation we use here allows us to
discuss case-based reasoning from a perspective that is closer to logic, thereby
allowing the comparison of precedents in terms of general formulas. In this way,
we are able to present a new generalization and a new re nement of precedent
comparison in case-based reasoning with the precedent model formalism.
      </p>
      <p>The new generalization of precedent comparison Case-based reasoning
models following HYPO often discuss comparison between precedents in terms of
factors. In the formalism we present here, we generalize the comparison approach
in case-based reasoning, namely comparing precedents not only with factors, but
also with more general propositional formulas.</p>
      <p>
        Section 3.1 shows a key di erence between our comparison approach and
formalizations that follow HYPO [
        <xref ref-type="bibr" rid="ref16 ref4 ref6">4, 6, 16</xref>
        ]. Factors in HYPO-style comparison
typically favor a side in the court case, showing which factors can strengthen or
weaken the arguments given by the parties involved, hence constraining possible
argument moves. However, the more general formulas used in our comparison
approach may not favor a speci c side in the court (as shown in Section 2). The
formulas we discuss are more general logical expressions than factors.
      </p>
      <p>As shown in Section 3.2, when comparing American Precision and Yokana in
terms of the analogy relation de ned in De nition 4, the result of this comparison
is di erent from other comparison relations, namely the preference relation in
precedent models and the on pointness in HYPO. According to the preference
relation in (P; P P ), American Precision and Yokana are as preferred as each
other; according to the on pointness, American Precision is more on point with
respect to Mason; and according to the analogy relation, these two precedents are
analogously incomparable with respect to Mason. This is because the analogy
relation discusses comparison in terms of the most speci c analogy between
precedents, while other comparison relations are in terms of other notions.</p>
      <p>
        The new comparison approach allows us to discuss general formulas beyond
factors in case-based reasoning, such as conjunctions or disjunctions of factors,
which can bring new discussion on case-based reasoning with the precedent
model formalism. For instance, for future research we can discuss hierarchical
factors shown in CATO [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], as higher level factors can be represented with
compound formulas based on base-level factors. Therefore, it seems possible to
compare abstract factors between precedents directly, and discuss argument moves
like downplaying a distinction in the formalism.
      </p>
      <p>
        The new re nement of precedent comparison In [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], we don't distinguish
the distinctions and relevances between precedent, nor do HYPO [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and other
case-based reasoning models [
        <xref ref-type="bibr" rid="ref15 ref6">6, 15</xref>
        ]. In the formalism we present here, relevances
between precedents are distinguished from analogies and from distinctions. While
analogies between two precedents refer to formulas that hold in both precedents,
and distinctions to formulas that hold in one precedent and are negated in the
other, relevances are formulas that are not yet determined in a precedent and
hence have the potential to turn out as an analogy or distinction once
determined. Although both distinctions and relevances are related to the unshared
factors, these formulas cannot be considered as distinctions directly, since if
such relevant formulas in a precedent can be found in a situation, they will be
considered as analogies rather than distinctions between the precedent and the
situation.
      </p>
      <p>As shown in Section 3.1, the relevant similarity and the relevant di erence
between cases in HYPO can be formalized by analogies, distinctions and
relevances de ned in De nition 3. Although the relevant similarity is an analogy
between precedents, factors in the relevant di erence are not always distinctions
between precedents, but also can be relevances. In this sense, our approach
compares precedents in a more speci c way than HYPO. However, as we haven't
de ned dimension of factors in the formalism, it is unable to discuss magnitude
of factors in relevant di erences, which means we cannot compare precedents in
terms of dimensions, such as nding a contrary case which has some factors with
extreme magnitude. This needs further discussion in the future.</p>
      <p>This re nement also points to case-based reasoning in a dynamic scenario,
in which the situation can change accordingly when new facts are found. For
instance, in the example shown in Figure 2, when comparing Yokana with Mason,
F1 ^ F21 is a relevance between them. If these two factors can be found in
Yokana, then it will be more on point than American Precision with respect
to Mason. However, if the :F21 is implied by Yokana, then F21 and :F21 will
become the distinctions between these two cases.</p>
      <p>
        Continuing from the preliminary report [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and the technical note [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], in
this paper, we applied the approach of precedent comparison to a real legal
domain, and discuss it with the case comparison in HYPO [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. With the precedent
model formalism, we provide a way that both generalizes and re nes case-based
reasoning with factors. We discuss not only the shared factors between
precedents, but also other compound formulas based on factors, which allows us to
compare precedents from a more logical perspective and discuss other features
among precedents. In this way, we show a new generalization of case-based
reasoning with factors. We further distinguish the unshared formulas as distinctions
and as relevances, i.e., unshared formulas between two precedents that are
relevant for the analogies and distinctions that can arise in a discussion. In this way,
we show a new re nement of case-based reasoning with factors. These ideas show
that the precedent model formalism has the potential to help analyze argument
moves in case-based reasoning and support the selection of good precedents to
cite in a court discussion, these still need further research in the future. It would
also be interesting to investigate computational mechanisms to discover good
argument moves in a legal discussion using precedent models.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>K. D. Ashley</surname>
          </string-name>
          .
          <article-title>Arti cial Intelligence and Legal Analytics: New Tools for Law Practice in the Digital Age</article-title>
          . Cambridge University Press, Cambridge,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>L. Thorne</given-names>
            <surname>McCarty</surname>
          </string-name>
          .
          <article-title>An implementation of Eisner v</article-title>
          . Macomber.
          <source>In Proceedings of the Fifth International Conference on Articial Intelligence and Law</source>
          ,
          <string-name>
            <surname>ICAIL</surname>
          </string-name>
          <year>1995</year>
          , pages
          <fpage>276</fpage>
          {
          <fpage>286</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>E. L.</given-names>
            <surname>Rissland</surname>
          </string-name>
          and
          <string-name>
            <given-names>K. D.</given-names>
            <surname>Ashley</surname>
          </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>
          ,
          <string-name>
            <surname>ICAIL</surname>
          </string-name>
          <year>1987</year>
          , pages
          <fpage>60</fpage>
          {
          <fpage>66</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>K. D. Ashley</surname>
          </string-name>
          .
          <article-title>Modeling Legal Arguments: Reasoning with Cases and Hypotheticals</article-title>
          . MIT Press, Cambridge,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>D. B.</given-names>
            <surname>Skalak</surname>
          </string-name>
          and
          <string-name>
            <given-names>E. L.</given-names>
            <surname>Rissland</surname>
          </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>
          ):3{
          <fpage>44</fpage>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Vincent</given-names>
            <surname>Aleven</surname>
          </string-name>
          .
          <article-title>Teaching case-based argumentation through a model and examples</article-title>
          .
          <source>PhD thesis</source>
          , University of Pittsburgh,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>K. D. Ashley</surname>
            and
            <given-names>S.</given-names>
          </string-name>
          <article-title>Bruninghaus. 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="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>L. K.</given-names>
            <surname>Branting</surname>
          </string-name>
          .
          <article-title>Building explanations from rules and structured cases</article-title>
          .
          <source>International Journal of Man-Machine Studies</source>
          ,
          <volume>34</volume>
          (
          <issue>6</issue>
          ):
          <volume>797</volume>
          {
          <fpage>837</fpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>K.</given-names>
            <surname>Satoh</surname>
          </string-name>
          .
          <article-title>Translating Case-Based Reasoning into Abductive Logic Programming</article-title>
          . In W. Wahlster, editor,
          <source>Proceedings of the 12th European Conference on Arti cial Intelligence</source>
          ,
          <source>ECAI</source>
          <year>1996</year>
          , pages
          <fpage>142</fpage>
          {
          <fpage>146</fpage>
          . Wiley, Chichester,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>K.</given-names>
            <surname>Satoh</surname>
          </string-name>
          .
          <article-title>Using Two Level Abduction to Decide Similarity of Cases</article-title>
          . In Prade H., editor,
          <source>Proceedings of the 13th European Conference on Arti cial Intelligence</source>
          ,
          <source>ECAI</source>
          <year>1998</year>
          , pages
          <fpage>398</fpage>
          {
          <fpage>402</fpage>
          . Wiley, Chichester,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>H.</given-names>
            <surname>Prakken</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Sartor</surname>
          </string-name>
          .
          <article-title>Modelling Reasoning with Precedents in a Formal Dialogue Game</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          ,
          <volume>6</volume>
          :
          <fpage>231</fpage>
          {
          <fpage>287</fpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>C. L. Hafner</surname>
            and
            <given-names>D. H.</given-names>
          </string-name>
          <string-name>
            <surname>Berman</surname>
          </string-name>
          .
          <source>The Role of Context in Case-Based Legal Reasoning: Teleological</source>
          , Temporal, and
          <string-name>
            <surname>Procedural</surname>
          </string-name>
          .
          <source>Arti cial Intelligence and Law</source>
          ,
          <volume>10</volume>
          (
          <issue>1</issue>
          {3):
          <volume>19</volume>
          {
          <fpage>64</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>B.</given-names>
            <surname>Roth</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Verheij</surname>
          </string-name>
          .
          <article-title>Dialectical Arguments and Case Comparison</article-title>
          . In T.F. Gordon, editor,
          <source>Legal Knowledge and Information Systems. JURIX 2004: The Seventeenth Annual Conference</source>
          , pages
          <volume>99</volume>
          {
          <fpage>108</fpage>
          . IOS Press, Amsterdam,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>A.</given-names>
            <surname>Wyner</surname>
          </string-name>
          .
          <article-title>An ontology in OWL for legal case-based reasoning</article-title>
          .
          <source>Arti cial Intelligence and Law</source>
          ,
          <volume>16</volume>
          (
          <issue>4</issue>
          ):
          <fpage>361</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15. H.
          <string-name>
            <surname>Prakken</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Wyner</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Bench-Capon</surname>
            , and
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Atkinson</surname>
          </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>
          , 05
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>J.</given-names>
            <surname>Horty</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Bench-Capon</surname>
          </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="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>K.</given-names>
            <surname>Cyras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Satoh</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Toni</surname>
          </string-name>
          .
          <article-title>Abstract Argumentation for Case-Based Reasoning</article-title>
          .
          <source>In Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning (KR</source>
          <year>2016</year>
          ), pages
          <fpage>549</fpage>
          {
          <fpage>552</fpage>
          . AAAI Press,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. L.
          <string-name>
            <surname>Al-Abdulkarim</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Atkinson</surname>
            , and
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Bench-Capon</surname>
          </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>
          ):1{
          <fpage>49</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>H.</given-names>
            <surname>Prakken</surname>
          </string-name>
          .
          <article-title>Comparing Alternative Factor- and Precedent-based Accounts of Precedential Constraint</article-title>
          . In M. Araszkiewicz and V. Rodriguez-Doncel, editors,
          <source>Legal Knowledge and Information Systems. JURIX</source>
          <year>2019</year>
          :
          <article-title>The Thirty-Second Annual Conference</article-title>
          , pages
          <volume>73</volume>
          {
          <fpage>82</fpage>
          . IOS Press, Amsterdam,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. H.
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Grossi</surname>
            , and
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Verheij</surname>
          </string-name>
          .
          <article-title>Case-Based Reasoning with Precedent Models: Preliminary Report</article-title>
          . In H. Prakken,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bistarelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Santini</surname>
          </string-name>
          , and C. Taticchi, editors,
          <source>Computational Models of Argument. Proceedings of COMMA</source>
          <year>2020</year>
          , volume
          <volume>326</volume>
          , pages
          <fpage>443</fpage>
          {
          <fpage>450</fpage>
          . IOS Press, Amsterdam,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>B.</given-names>
            <surname>Verheij</surname>
          </string-name>
          . Formalizing Arguments,
          <article-title>Rules and Cases</article-title>
          .
          <source>In Proceedings of the Sixteenth International Conference on Articial Intelligence and Law</source>
          ,
          <string-name>
            <surname>ICAIL</surname>
          </string-name>
          <year>2017</year>
          , pages
          <fpage>199</fpage>
          {
          <fpage>208</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. H.
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Xiong</surname>
            , and
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Verheij</surname>
          </string-name>
          .
          <article-title>Checking the Validity of Rule-Based Arguments Grounded in Cases: A Computational Approach</article-title>
          . In M. Palmirani, editor,
          <source>Legal Knowledge and Information Systems. JURIX</source>
          <year>2018</year>
          :
          <article-title>The Thirty-</article-title>
          rst Annual Conference, volume
          <volume>313</volume>
          , pages
          <fpage>220</fpage>
          {
          <fpage>224</fpage>
          . IOS Press, Amsterdam,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. H.
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Grossi</surname>
            , and
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Verheij</surname>
          </string-name>
          .
          <article-title>Precedent Comparison in the Precedent Model Formalism: A Technical Note</article-title>
          . In S. Villata,
          <string-name>
            <given-names>J.</given-names>
            <surname>Harasta</surname>
          </string-name>
          , and P. Ksemen, editors,
          <source>Legal Knowledge and Information Systems. JURIX</source>
          <year>2020</year>
          :
          <article-title>The Thirty-third Annual Conference</article-title>
          , volume
          <volume>334</volume>
          , pages
          <fpage>259</fpage>
          {
          <fpage>262</fpage>
          . IOS Press, Amsterdam,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>