<!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>Encompassing uncertainty in argumentation schemes</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Pietro Baroni</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Massimiliano Giacomin</string-name>
          <email>massimiliano.giacoming@ing.unibs.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Beishui Liao Zhejiang University</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Leon van der Torre University of Luxembourg</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Universita` degli Studi di Brescia</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In existing literature, little attention has been paid to the problems of how the uncertainty reflected by natural language text (e.g. verbal and linguistic uncertainty) can be explicitly formulated in argumentation schemes, and how argumentation schemes enriched with various types of uncertainty can be exploited to support argumentation mining and evaluation. In this paper, we focus on the first problem, and introduce some preliminary ideas about how to classify and encompass uncertainty in argumentation schemes.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Mining and evaluating arguments from natural
language text
        <xref ref-type="bibr" rid="ref7">(Green et al., 2014)</xref>
        is a relatively
new research direction with applications in
several areas ranging from legal reasoning
        <xref ref-type="bibr" rid="ref1 ref12 ref13 ref14">(Palau and
Moens, 2011)</xref>
        to product evaluation
        <xref ref-type="bibr" rid="ref21">(Wyner et al.,
2012)</xref>
        . Argumentation schemes
        <xref ref-type="bibr" rid="ref19">(Walton et al.,
2008)</xref>
        are commonly adopted in this context as a
first modeling tool: it is assumed that natural
arguments adhere to a set of paradigmatic schemes,
so that these schemes can be used both to drive
the identification of the arguments present in the
text and, after that, to support their formal
representation. As a further step, the assessment of
argument justification status requires to identify
the relations among them and to apply a formal
method, called argumentation semantics to derive
the status from these relations. For instance, the
well known1 Dung’s theory of abstract
argumentation
        <xref ref-type="bibr" rid="ref6">(Dung, 1995)</xref>
        focuses on the relation of attack
between arguments and provides a rich variety of
alternative semantics
        <xref ref-type="bibr" rid="ref1">(Baroni et al., 2011)</xref>
        for
argument evaluation on this basis.
      </p>
      <p>Corresponding author
1Due to space limitations, we assume knowledge of
Dung’s theory in the following.</p>
      <p>When dealing with natural language sources,
one of the challenging problems is to handle the
uncertainty of arguments. In fact, natural language
statements typically include several kinds of
uncertainty. This calls for the need to encompass
uncertainty in the formalisms which are meant to
provide a representation of natural arguments, first
of all in argumentation schemes, in order to avoid
that some useful information carried by the text
source is lost in the first modelling step.</p>
      <p>To illustrate this problem, let us consider a
simple example concerning two conflicting natural
language excerpts E1 and E2, possibly taken from
some medical publications:</p>
      <p>E1: According to [Smith 98], drug X often
causes the side effect Y.</p>
      <p>E2: According to recent experimental trials, it
is highly likely that drug X does not increase the
probability of the side effect Y.</p>
      <p>
        In order to identify argument structures in these
texts, one may resort to specific argumentation
schemes. Referring to the classification proposed
in
        <xref ref-type="bibr" rid="ref19">(Walton et al., 2008)</xref>
        , E1 can be represented by
an argument A1 which is an instance of the scheme
Argument from Expert Opinion, while E2 by an
argument A2 which is an instance of the scheme
Argument From Falsification.
      </p>
      <p>
        After A1 and A2 are identified, it may be noted
that (though expressed with different linguistic
nuances) their conclusions are in conflict: briefly, A1
leads to the claim that X causes Y, while A2 to the
claim that X does not cause Y. As a consequence,
a mutual attack relation between A1 and A2 can
be identified. Then, the arguments and their
attacks can be formalized as an abstract
argumentation framework AF = (fA1; A2g, f(A1, A2),
(A2; A1)g) and the status of arguments in AF can
be evaluated according to a given argumentation
semantics. For instance, under grounded
semantics, both A1 and A2 are not accepted. It must
be noted however that such a modelling approach
        <xref ref-type="bibr" rid="ref10 ref11 ref4 ref9">(and the relevant outcome in terms of argument
2012; Hunter, 2013a; Hunter, 2014)</xref>
        while, to the
evaluation) overlooks some information which is
best of our knowledge, lesser work has been
de(implicitly or explicitly) carried by the text and
voted to encompassing uncertainty in
argumentathat may lead, in particular, to have one of the
artion schemes.
guments prevailing over the other. For instance, as
This long-term research goal involves several
considered in
        <xref ref-type="bibr" rid="ref2">(Bex et al., 2013)</xref>
        , one may have a
basic questions including:
preference relation over argument schemes so that,
for instance, the scheme Argument From
Falsification is preferred to the scheme Argument from
Expert Opinion. Accordingly, A2 would be
preferred to A1, and the attack relation would not be
mutual, due to the inability of A1 to attack A2 (see
the notion of preference-dependent attack in (Bex
1) How the uncertainty reflected by natural
language text can be explicitly formulated in
argumentation schemes?
      </p>
      <p>2) How argumentation schemes enriched with
various types of uncertainty can be exploited to
support argument mining and evaluation?
3) Which is (are) the most appropriate abstract
et al., 2013)). In this case, we would get a
differformalism(s) for the evaluation of arguments with
f(A2; A1)g).</p>
      <p>A1 is rejected, while A2 is accepted.</p>
      <p>Then, under grounded semantics,
ent argumentation framework AF 0 = (fA1; A2g,
uncertainty?</p>
      <p>Texts with
uncertainty
(e.g. verbal /
linguistic
uncertainty)
Argument</p>
      <p>Mining
Argumentation
schemes with
uncertainty</p>
      <p>Semi-formal
argumentation
with
uncertainty</p>
      <p>B
B
NB</p>
      <p>Formal
argumentation
with
uncertainty</p>
      <p>A
A</p>
      <p>UA
Argument
Formalization</p>
      <p>Argument
Evaluation</p>
      <p>However, a static preference relation on the
adopted scheme appears too rigid: in most cases
the preference for an argument over another one
is not simply based on their structure but, rather,
on their content. To exemplify, in this case, one
may have different opinions on the reliability of
the source [Smith 98], mentioned in E1, and of
the experimental trials mentioned in E2.
Moreover, the two excerpts include several terms
expressing vagueness and/or uncertainty, like
often, highly likely, the probability of, that may
be taken into account in the preference ranking
of arguments.</p>
      <p>However, this is not possible in
the approach sketched above, since the argument
schemes adopted in the formalization do not
encompass these forms of uncertainty and the
relevant information carried by the text is lost in the
first modelling step.</p>
      <p>Given the pervasiveness of vagueness and
uncertainty in natural language this appears to be
a severe limitation for the use of argumentation
schemes in argument mining from texts. To
overcome this problem we envisage the study of
argumentation schemes extended with uncertainty
in the context of the process sketched in Figure
1. Here argumentation schemes with uncertainty
are used to extract arguments from texts, keeping
explicit the relevant uncertainties that can then be
used in the step of argument evaluation using
suitIn natural language texts different types of
uncerable abstract formalisms and semantics with
untainty can be identified. To give a brief account of
certainty. As to the latter step, the study of
exthe richness and complexity of this topic and of the
tensions of Dung’s framework with explicit
unresearch activities that are being carried out in this
certainty representation is receiving increasing
atarea, we quickly recall some examples of
uncertention in recent years (Li et al., 2011a; Thimm,
tainty classifications considered in the literature.</p>
      <p>
        In the context of scientific discourse, de Waard
and
        <xref ref-type="bibr" rid="ref18">Maat (2012</xref>
        ) distinguish knowledge evaluation
(also called epistemic modality) from knowledge
attribution (also called evidentiality). The former
basically concerns the degree of commitment with
respect to a given statement, while the latter
concerns the attribution of a piece of knowledge to
a source. Accordingly, different kinds of
uncertainty can be identified.
      </p>
      <p>
        For instance, according to de Waard and
        <xref ref-type="bibr" rid="ref18">Maat
(2012</xref>
        ), sources of knowledge may be
distinguished into the following categories:
      </p>
      <p>1) Explicit source of knowledge: the knowledge
evaluation can be explicitly owned by the author
(‘We therefore conclude that . . . ’) or by a named
referent (‘Vijh et al. [28] demonstrated that . . . ’).</p>
      <p>2) Implicit source of knowledge: if there is no
explicit source named, knowledge can implicitly
still be attributed to the author (‘ these results
suggest . . . ’) or an external source (‘It is generally
believed that . . . ’).</p>
      <p>3) No source of knowledge: the source of
knowledge can be absent entirely, e.g. in factual
statements, such as ‘transcription factors are the
final common pathway driving differentiation’.</p>
      <p>Since different sources may have different
degrees of credibility, this leads to identify a first
type of uncertainty, namely the (possibly implicit)
source uncertainty.</p>
      <p>
        As to knowledge evaluation, de Waard and
        <xref ref-type="bibr" rid="ref18">Maat
(2012</xref>
        ), follo
        <xref ref-type="bibr" rid="ref20">wing Wilbur et al. (2006</xref>
        ), distinguish
four levels of certainty in the degree of
commitment of a subject to a statement: 1) Doxastic (firm
belief in truth), 2) Dubitative (some doubt about
the truth exists), 3) Hypothetical (the truth value is
only proposed), and 4) Lack of knowledge.
      </p>
      <p>This kind of evaluation, called uncertainty
about statements in the following, is typically
expressed through suitable linguistic modifiers.</p>
      <p>
        Actually linguistic modifiers have a quite
generic nature and have been the subject of
specific stu
        <xref ref-type="bibr" rid="ref3">dies by themselves: Clark (1990</xref>
        )
provides an extensive review of experimental
studies concerning the use of linguistic uncertainty
expressions, such as possible, probable, likely, very
likely, highly likely, etc., and their numerical
representation. Linguistic uncertainty is pervasive
in natural language communication. On the one
hand, it can be regarded as a form of uncertainty
expression (alternative to, e.g., numerical or
implicit uncertainty expressions) rather than as a
distinct uncertainty type. On the other hand,
linguistic uncertainty may be regarded as a generic type
of uncertainty, of which other more specific forms
of uncertainty are subtypes. This generic type can
be associated to those natural language statements
to which a more specific uncertainty type can not
be applied. For the sake of the preliminary
analysis carried out in this paper, we will adopt the latter
view.
      </p>
      <p>Regan et al. (2002) distinguish between
epistemic uncertainty (uncertainty in determinate
facts) and linguistic uncertainty (uncertainty in
language) and claims that the latter has received
by far less attention in uncertainty classifications
in the fields of ecology and biology. Linguistic
uncertainty is in turn classified into five distinct
types: vagueness, context dependence,
ambiguity, indeterminacy of theoretical terms, and
underspecificity, with vagueness being claimed to be
the most important for practical purposes. In fact,
all of them refer in some way to the problem that
some natural language expressions admit
alternative interpretations. Hence this classification is
focused on a specific form of uncertainty and the use
of the term linguistic uncertainty here is rather
restricted with respect to other works.</p>
      <p>Taking into account the discussion above, in this
paper we consider, as a starting point, three
uncertainty types:</p>
      <p>1) Source uncertainty, denoted in the following
as U1, concerning the fact that to evaluate the
credibility of different statements one may take into
account the credibility of their sources;</p>
      <p>2) Uncertainty about a statement, denoted as
U2, arising in situations where a subject making
a statement expresses a partial degree of
commitment to the statement itself;</p>
      <p>3)Linguistic uncertainty or uncertainty inside
a statement, denoted as U3, namely uncertainty
generically present in natural language statements,
with no further more precise meaning specified.</p>
      <p>For instance in the sentences “According to
[Smith 98], Drug X causes headache” and
“According to recent experimental trials, Drug X
causes headache”, one may identify U1 since they
refer the statement “Drug X causes headache” to a
source (a paper and clinical trials, respectively).</p>
      <p>On the other hand, the sentence “It is likely that
Drug X causes headache” provides an example of
U2 since the statement “Drug X causes headache”
is not regarded as certain.</p>
      <p>Finally, a sentence like “Drug X sometimes
causes severe headache” provides an example of
U3.</p>
      <p>
        For a more articulated example including
several uncertainty types, let us consider the
following text, taken from
        <xref ref-type="bibr" rid="ref16">(Swenson, 2014)</xref>
        : “. . . , the
Mg inhibition of the actin-activated ATPase
activity observed in class II myosins is likely the
result of Mg-dependent alterations in actin binding.
Overall, our results suggest that Mg reduces the
ADP release rate constant and rate of attachment
to actin in both high and low duty ratio myosins. ”
      </p>
      <p>
        Here, some expressions (likely and suggest that)
indicate a partial commitment of authors to the
corresponding statements (U2), and the
knowledge source is made explicit by the citation of
        <xref ref-type="bibr" rid="ref16">(Swenson, 2014)</xref>
        (U1). Further, the vague terms
(high and low) correspond to a form of generic
linguistic uncertainty inside the relevant statement
(U3).
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>Non-uniformity of uncertainty representation in existing schemes</title>
      <p>
        Given that uncertainty pervades natural language
texts and argumentation schemes appear as
suitable formal tool for argumentation mining from
texts, the question of how to capture uncertainty in
argumentation schemes naturally arises. This
appears to be an open research question, as the
stateof-the-art formulation of argumentation schemes
        <xref ref-type="bibr" rid="ref19">(Walton et al., 2008)</xref>
        does not consider uncertainty
explicitly, and, more critically, does not seem to
deal with uncertainty in a systematic way, though
somehow recognizing its presence. To exemplify
this problem let us compare two argumentation
schemes2 from
        <xref ref-type="bibr" rid="ref19">(Walton et al., 2008)</xref>
        .
      </p>
      <p>The first scheme we consider, called Argument
from Position to Know (APK), is defined as
follows:</p>
      <p>Major Premise: Source a is in a position to
know about things in a certain subject
domain S containing proposition A.</p>
      <p>Minor Premise: a asserts that A (in domain S)
is true (false).</p>
      <p>Conclusion: A is true (false).</p>
      <p>CQ1: Is a in a position to know whether A is
2Recall that an argument scheme basically consists of a
set of premises, a conclusion defeasibly derivable from the
premises according to the scheme, and a set of critical
questions (CQs) that can be used to challenge arguments built on
the basis of the scheme.</p>
      <p>true (false)?
CQ2: Is a an honest (trustworthy, reliable)
source?
CQ3: Did a assert that A is true?</p>
      <p>In this scheme, no explicit uncertainty is
included, but the critical questions correspond to
several forms of uncertainty that may affect it.</p>
      <p>The second scheme, called Argument from
Cause to Effect (ACE), is defined as follows:
Major Premise: Generally, if A occurs, then B
will (might) occur.</p>
      <p>Minor Premise: In this case, A occurs (might
occur).</p>
      <p>Conclusion: Therefore, in this case, B will
(might) occur.</p>
      <p>CQ1: How strong is the causal generalization?
CQ2: Is the evidence cited (if there is any)
strong enough to warrant the casual
generalization?
CQ3: Are there other causal factors that could
interfere with the production of the effect in
the given case?</p>
      <p>In this case, in addition to the implicit
uncertainty corresponding to critical questions, explicit
expressions of uncertainty are included, namely
the modifier Generally and the might
specifications in the parentheses.</p>
      <p>Clearly the representation of uncertainty in the
two schemes is not uniform (since the second
scheme encompasses explicit uncertainty in the
premises and the conclusion, while the first does
not) but it is not clear whether this non-uniformity
is based on some underlying difference between
the schemes or is just accidental in the natural
language formulation of the schemes. Indeed, it
seems possible to reformulate these schemes in a
dual manner (adding explicit uncertainty mentions
to the first one, removing them from the second
one) while not affecting their meaning, as follows:</p>
      <sec id="sec-2-1">
        <title>APK with explicit uncertainty:</title>
        <p>Major Premise: Source a is (possibly) in a
position to know about things in a certain
subject domain S containing proposition A.
Minor Premise: a asserts that A (in domain S)
is (might be) true (false).</p>
        <p>Conclusion: A is (might be) true (false).</p>
      </sec>
      <sec id="sec-2-2">
        <title>ACE without explicit uncertainty:</title>
        <p>Major Premise: If A occurs, then B will occur.
Minor Premise: In this case, A occurs.</p>
        <p>Conclusion: Therefore, in this case, B will</p>
        <p>The above-mentioned non-uniformity suggests
that a more systematic treatment of uncertainty in
argument schemes is needed in order to face the
challenges posed by the representation of natural
language arguments.</p>
        <p>
          Indeed, a recent work
          <xref ref-type="bibr" rid="ref17">(Tang et al., 2013)</xref>
          addresses the relationships between uncertainty and
argument schemes in a related but
complementary research direction. While the work described
in the present paper aims at enriching
argumentation schemes proposed in the literature with
explicit uncertainty representation in a systematic
way, Tang et al. (2013) introduce several novel
argument schemes concerning reasoning about
uncertainty. This is done using Dempster-Shafer
theory of evidence in the context of a formalism for
the representation of evidence arguments.
Different schemes basically differ in the choice of the
rule for (numerical) evidence combination among
the many alternative combination rules available
in the literature, and the critical questions in each
scheme refer to the applicability conditions of the
relevant rule (e.g. Is each piece of evidence
independent?). Investigating the possible reuse of
some of the specific ideas presented by Tang et al.
(2013) in the context of our broader modelling
approach is an interesting direction of future work.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Encompassing uncertainty in argumentation schemes</title>
      <p>Devising a systematic approach to encompass
natural language uncertainty in argumentation
schemes is a long term research goal, posing
many conceptual and technical questions and
challenges, partly evidenced in the previous sections.
We suggest that such an approach should include
the following “ingredients”:
1) a classification of uncertainty types;
2) a characterization of the uncertainty types
relevant to each argumentation scheme;</p>
      <p>3) a formalism for the representation of
uncertainty evaluations (of various types) in actual
arguments, i.e. in instances of argument schemes;
4) a mechanism to derive an uncertainty
evaluation for the conclusion of an argument from the
evaluations concerning the premises and the
applied scheme.</p>
      <p>While each of the items listed above is, by
itself, a large and open research question, we
provide here some preliminary examples of point 2,
using for point 1 the simple classification
introduced in Section 2. In particular we suggest that
the scheme specification should be accompanied
by an explicit account of the types of uncertainty
it may involve, while the use of linguistic
uncertainty expressions in the scheme (like in ACE
above) should be avoided within the natural
language description of the scheme itself. This
approach prevents the non-uniformities pointed out
in Section 3 and enforces the adoption of clear
modelling choices about uncertainty at the
moment of definition of the scheme. In particular, as
evidenced below, it may point out some
ambiguities in the definition of the scheme itself.</p>
      <p>In the following examples, we explicitly
associate uncertainty types with the premises of the
considered schemes (that may affected by them)
and with the critical questions (that point out
the potential uncertainty affecting the premises).
Analysing the uncertainty possibly affecting the
scheme itself or its applicability (that may also
be expressed by some critical questions) is left to
future work (and requires a richer classification
of uncertainty types), while, according to point 4
above, the uncertainty about the conclusion is
regarded as a derived notion and, for the sake of the
present analysis, is considered as derived
uncertainty, denoted as DU. The syntax we use to
associate uncertainty types with parts of argument
schemes is as follows: f: : :g[Ux; : : :], where the
part of the scheme (possibly) affected by
uncertainty is enclosed in braces and is followed by the
relevant uncertainty type(s) enclosed in brackets.</p>
      <p>First, let us consider the APK scheme. Here,
the major premise explicitly refers to a source a,
so it can be associated with U1 (as evidenced by
the critical questions CQ1 and CQ2). Further one
may consider that the inclusion of proposition A in
domain S and the proposition A itself can be
specified with some linguistic uncertainty (U3). As to
the minor premise, since it refers explicitly to a
given assertion, it can be associated with
uncertainty about assertions (U2). Actually, the critical
question CQ3 refers to the minor premise and its
statement “Did a assert that A is true?” is, in fact,
ambiguous as far as the type of uncertainty is
concerned. On the one hand it might raise a doubt
about the fact that a did actually make any
assertion about A, on the other hand it might raise a
doubt about the contents of the assertion made by
a. For instance, a might have made a weaker
assertion, like “A is probably true”, or a completely
different assertion like “A is false”. The three
alternatives mentioned above are rather different
and involve different uncertainty types. The
possibility that a made a weaker assertion is a case
of U2, while if a made a completely different
assertion (or no assertion at all) about A, the entire
minor premise is challenged, and this amounts to
be uncertain about the credibility of the (implicit)
source from which we learned that “a asserted that
A is true”, hence a case of U1. As this ambiguity
is present in the current formulation of the scheme,
we leave it unresolved and indicate both types of
uncertainty for the minor premise and CQ3.</p>
      <p>This leads to reformulate APK as follows:
Major Premise: fSource a is in a position to
know about things in a certain subject
domain Sg[U1] fcontaining proposition</p>
      <p>Ag[U3].</p>
      <p>Minor Premise: fa asserts that A (in domain S)
is true (false)g[U1; U2].</p>
      <p>Conclusion: fA is true (false)g[DU].</p>
      <p>CQ1: fIs a in a position to know whether A is
true (false)?g[U1]
CQ2: fIs a an honest (trustworthy, reliable)
source?g[U1]
CQ3: fDid a assert that A is true?g[U2; U1].</p>
      <p>Let us now consider the ACE scheme. Its first
premise is a causal generalization, which, as
suggested by the use of (might) in its original
formulation, is not always valid. In our simple
classification this can be regarded as a form of linguistic
uncertainty inside the statement (U3). This kind
of uncertainty may also affect the actual
formulation of the statements A and B in the
instantiations of the scheme. The major premise is
challenged by CQ1 and CQ2. While their
interpretation allows some overlap, CQ1 seems to concerns
the “strength” of the causal generalization as it is
formulated, while CQ2 refers to the implicit
evidential source of knowledge supporting the causal
generalization. Accordingly, CQ1 may be referred
to U3, while CQ2 to U1.</p>
      <p>The minor premise concerns the observation of
a fact (the occurrence of A), that might involve
linguistic uncertainty U3. Indeed, also the
observation of the occurrence of A might have a source,
so that, in principle, the second premise might
be affected by U1, and one might have an
additional critical question CQ+ like “Does A
actually occur?”, which would turn out very similar
in nature to CQ3 in the APK scheme. The fact
that a question like CQ+ is not considered in this
scheme, points out a further non-uniformity in the
formulation of argument schemes: one may
wonder why a sort of explicit confirmation of the
minor premise is required by a critical question in the
APK scheme, while the same kind of
confirmation is not required in the ACE scheme. While one
might answer that similar questions may have a
different importance in different schemes, we
suggest that a further analysis is needed to address
these issues in a systematic way and that a
classification of uncertainty types can be very useful
in this respect. To point out this, we add CQ+
in the revised version of the ACE scheme, with
the relevant uncertainty type U1 associated with
the minor premise. Finally, CQ3 raises the
question about possible other factors interfering with
the causal relation between A and B, i.e. suggests
the presence of possible exceptions in the
application of the scheme. This kind of uncertainty is not
encompassed in our simplistic preliminary
classification, hence we let it unspecified (denoted as
[??]), as a pointer to future developments. This
leads to reformulate ACE as follows:</p>
      <p>Major Premise:fIf A occurs, then B will occurg
[U1; U3].</p>
      <p>Minor Premise: fIn this case, A occursg
[U1; U3].</p>
      <p>Conclusion:fTherefore, in this case, B will
occurg [DU ].</p>
      <p>CQ1: fHow strong is the causal</p>
      <p>generalization?g[U3]
CQ2: fIs the evidence cited (if there is
any) strong enough to warrant the casual
generalization?g[U1]
CQ+: fDoes A actually occur?g[U1]
CQ3: fAre there other causal factors that
could interfere with the production of the
effect in the given case?g[??]
5</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>
        In recent years, the issue of combining
explicit uncertainty representation and
argumentation has received increasing attention, with
several works dealing in particular with probabilistic
argumentation
        <xref ref-type="bibr" rid="ref10 ref12 ref13 ref5 ref8 ref9">(Dung and Thang, 2010; Hunter,
2012; Hunter, 2013b; Li et al., 2011b)</xref>
        . These
works are based on formal argumentation
theories like Dung’s abstract argumentation
frameworks
        <xref ref-type="bibr" rid="ref6">(Dung, 1995)</xref>
        or logic-based
argumentation
        <xref ref-type="bibr" rid="ref10 ref9">(Hunter, 2013b)</xref>
        . This paper suggests that
these investigations on the formal side should be
complemented by efforts on the conceptual and
semi-formal side, with particular reference to the
argumentation schemes model. Argumentation
schemes provide a very intuitive semi-formal
representation approach for natural arguments and are
indeed adopted in several works as a first level
modelling tool to identify and extract arguments
from natural language texts. However, as
evidenced in this paper, argumentation schemes need
to be enriched and extended in order to capture
the various kinds of uncertainty typically present
in natural language arguments. The present work
provides a preliminary contribution to this
research line, by pointing out some problems and
providing some simple examples of how they
might be tackled. Future work directions are huge
and include an extensive review of the uncertainty
types considered in the literature, with special
attention to works in the area of argumentation
mining, and a systematic analysis of the various ways
argument schemes may be affected by different
uncertainty types.
      </p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgment</title>
      <p>The research reported in this paper was partially
supported by the National Science Foundation
of China (No.61175058), and Zhejiang
Provincial Natural Science Foundation of China (No.
LY14F030014).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>P.</given-names>
            <surname>Baroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Caminada</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Giacomin</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>An introduction to argumentation semantics</article-title>
          .
          <source>Knowledge Eng. Review</source>
          ,
          <volume>26</volume>
          (
          <issue>4</issue>
          ):
          <fpage>365</fpage>
          -
          <lpage>410</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>F.</given-names>
            <surname>Bex</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Modgil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Prakken</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Reed</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>On logical specifications of the argument interchange format</article-title>
          .
          <source>J. Log. Comput.</source>
          ,
          <volume>23</volume>
          (
          <issue>5</issue>
          ):
          <fpage>951</fpage>
          -
          <lpage>989</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Clark</surname>
          </string-name>
          .
          <year>1990</year>
          .
          <article-title>Verbal uncertainty expressions: A critical review of two decades of research</article-title>
          . Current Psychology: Research &amp; Reviews,
          <volume>9</volume>
          (
          <issue>3</issue>
          ):
          <fpage>203</fpage>
          -
          <lpage>235</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>A. de Waard</surname>
            and
            <given-names>H. P.</given-names>
          </string-name>
          <string-name>
            <surname>Maat</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Epistemic modality and knowledge attribution in scientific discourse: A taxonomy of types and overview of features</article-title>
          .
          <source>In Proc. of ACL</source>
          <year>2012</year>
          , pages
          <fpage>47</fpage>
          -
          <lpage>55</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>P. M. Dung</surname>
            and
            <given-names>P. M.</given-names>
          </string-name>
          <string-name>
            <surname>Thang</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Towards (probabilistic) argumentation for jury-based dispute resolution</article-title>
          .
          <source>In Proc. of COMMA</source>
          <year>2010</year>
          , pages
          <fpage>171</fpage>
          -
          <lpage>182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>P. M. Dung</surname>
          </string-name>
          .
          <year>1995</year>
          .
          <article-title>On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n-person games</article-title>
          .
          <source>Artificial Intelligence</source>
          ,
          <volume>77</volume>
          (
          <issue>2</issue>
          ):
          <fpage>321</fpage>
          -
          <lpage>357</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>N.</given-names>
            <surname>Green</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ashley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Litman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Reed</surname>
          </string-name>
          , and V. Walker, editors.
          <source>2014. ACL 2014 Proceedings of the First Workshop on Argumentation Mining</source>
          , Baltimore, Maryland, USA.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Hunter</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Some foundations for probabilistic abstract argumentation</article-title>
          .
          <source>In Proc. of COMMA</source>
          <year>2012</year>
          , pages
          <fpage>117</fpage>
          -
          <lpage>128</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Hunter</surname>
          </string-name>
          .
          <year>2013a</year>
          .
          <article-title>A probabilistic approach to modelling uncertain logical arguments</article-title>
          .
          <source>International Journal of Approximate Reasoning</source>
          ,
          <volume>54</volume>
          (
          <issue>1</issue>
          ):
          <fpage>47</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Hunter</surname>
          </string-name>
          .
          <year>2013b</year>
          .
          <article-title>A probabilistic approach to modelling uncertain logical arguments</article-title>
          .
          <source>International Journal of Approximate Reasoning</source>
          ,
          <volume>54</volume>
          (
          <issue>1</issue>
          ):
          <fpage>47</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Hunter</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Probabilistic qualification of attack in abstract argumentation</article-title>
          .
          <source>International Journal of Approximate Reasoning</source>
          ,
          <volume>55</volume>
          (
          <issue>2</issue>
          ):
          <fpage>607</fpage>
          -
          <lpage>638</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Oren</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T. J.</given-names>
            <surname>Norman</surname>
          </string-name>
          . 2011a.
          <article-title>Probabilistic argumentation frameworks</article-title>
          .
          <source>In Proc. of TAFA</source>
          <year>2011</year>
          , pages
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Oren</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T. J.</given-names>
            <surname>Norman</surname>
          </string-name>
          . 2011b.
          <article-title>Probabilistic argumentation frameworks</article-title>
          .
          <source>In Proc. of TAFA</source>
          <year>2011</year>
          , pages
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>R. Mochales</given-names>
            <surname>Palau and M.-F. Moens</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Argumentation mining</article-title>
          .
          <source>Artif. Intell. Law</source>
          ,
          <volume>19</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>H. M. Regan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Colyvan</surname>
            , and
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Burgman</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>A taxonomy and treatment of uncertainty for ecology and conservation biology</article-title>
          .
          <source>Ecological Applications</source>
          ,
          <volume>12</volume>
          (
          <issue>2</issue>
          ):
          <fpage>618</fpage>
          -
          <lpage>628</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Swenson</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Magnesium modulates actin binding and adp release in myosin motors</article-title>
          .
          <source>J. Biol. Chem</source>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Oren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Parsons</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Sycara</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Dempster-shafer argument schemes</article-title>
          .
          <source>In Proc. of ArgMAS</source>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>M.</given-names>
            <surname>Thimm</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>A probabilistic semantics for abstract argumentation</article-title>
          .
          <source>In Proc. of ECAI</source>
          <year>2012</year>
          , pages
          <fpage>750</fpage>
          -
          <lpage>755</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <given-names>D.</given-names>
            <surname>Walton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Reed</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Macagno</surname>
          </string-name>
          .
          <year>2008</year>
          . Argumentation Schemes. Cambridge University Press.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <surname>W. J. Wilbur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rzhetsky</surname>
            , and
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Shatkay</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>New directions in biomedical text annotation: definitions, guidelines and corpus construction</article-title>
          .
          <source>BMC Bioinformatics</source>
          ,
          <volume>7</volume>
          :
          <fpage>356</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Wyner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Atkinson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T. J. M.</given-names>
            <surname>Bench-Capon</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Semi-automated argumentative analysis of online product reviews</article-title>
          .
          <source>In Proc. of COMMA</source>
          <year>2012</year>
          , pages
          <fpage>43</fpage>
          -
          <lpage>50</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>