<!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>Argument Scheme Classification for Ethical Reasoning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Elfia</string-name>
          <email>elfia.bezou_vrakatseli@kcl.ac.uk</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bezou-Vrakatseli</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oana Cocarascu</string-name>
          <email>oana.cocarascu@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sanjay Modgil</string-name>
          <email>sanjay.modgil@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Informatics, King's College London</institution>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes progress towards realising the long-term research goal of supporting dialogue between humans and between humans and AI systems so as to enable transparent and rational joint reasoning, in particular about matters of ethical significance. Key to realising this goal is this paper's proposed exploration and analysis of natural language moral debates, via argument schemes and critical questions. We believe this to be an important first step in identifying schemes and scheme taxonomies, specialised for ethical reasoning, and that can support both the natural language processing needed to support human-AI dialogue, as well as for scafolding human-human dialogue.</p>
      </abstract>
      <kwd-group>
        <kwd>Dialogue</kwd>
        <kwd>argument schemes</kwd>
        <kwd>argument mining</kwd>
        <kwd>ethics</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Motivation</title>
      <p>
        Recent highly publicised successes in Artificial Intelligence (AI) applications have in large part
been due to advances in machine learning (notably deep learning) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. However, symbolic
approaches to AI will necessarily play a role in facilitating inter-agent (in particular human-AI and
human-human) communication which is inherently a symbolic activity. In particular, reasoning
in the presence of uncertainty, conflict, and disagreement typically benefits from multiple agents
engaged in information sharing and joint reasoning; that is, in dialogical exchanges normatively
governed by prescriptions encoded in logics for non-monotonic reasoning. One of the most
promising paradigms for facilitating such dialogues is through argumentation-based
characterisations of non-monotonic (nm) inference relations in terms of the exchange of arguments
constructed from a given static belief base. These ‘monological’ characterisations can then be
generalised to dialogical models in which agents exchange locutions (not limited to arguments),
such that evaluation of a dialogical exchange in favour of a claim equates with that claim being
a non-monotonic inference from the information shared during the course of the dialogue [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
As dialogues consist of informational exchanges, they enable the understanding of the parties
involved, not only as a direct result of the information each utterance conveys, but also as a
means of exploring the reasoning of the interlocutors. As a result, dialogues also facilitate joint
reasoning. Overall, the communication and joint reasoning of AI systems and humans leverages
the strengths of AI along with those of human reasoning.
CEUR
      </p>
      <p>
        Our long-term research goal is guiding humans and AI systems alike in building and
challenging arguments related to ethical issues as ethical reasoning is of crucial importance for
decision-making systems that can impact human lives [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Moreover, enabling joint human
and AI reasoning can help solve the value alignment problem [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and help ensure the ethical
behaviour, in accordance with human values, of agents as shown in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In order to support
dialogue between humans and between humans and AI systems that can enable transparent and
rational joint reasoning, we need to draw from recent advances in natural language processing
(NLP), and in particular argument mining [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], an area of research which focuses on extracting
arguments and their relations from text (e.g. relations between premises and conclusions).
      </p>
      <p>
        To this end, we begin by analysing natural language (NL) texts using argument schemes and
critical questions. In particular, we focus on annotating moral debates using two argument
scheme classifications: Walton [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and Wagemans [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. As the existing vast variety of taxonomies
and argument schemes is one of the biggest problems in the literature, we purport to reconcile
the two most used classifications and develop a theoretically well-founded, as well as practically
useful, hybrid classification that can be applied to ethical debates. Said reconciliation leverages
the strengths of both, while identifying the schemes particular to ethical reasoning. The novelty
of our research can be found in the attempt to go beyond standard argument mining techniques
(to determine the relation between premise and conclusion and identify support/attack relations
between arguments) by making use of informal logic. In particular, we make use of argument
schemes and critical questions that ofer a semantically richer approach to argument
classification, as premises support a conclusion by virtue of instantiating a scheme and support/attack
relations are instigated in response to critical questions.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Background &amp; Related Work</title>
      <p>
        Argument schemes represent stereotypical patterns of reasoning and consist of a set of premises
and a conclusion. Walton proposed over 60 argument schemes with corresponding sets of critical
questions which are used to evaluate the strength of an argument [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] . For example, Walton’s
representation of the argument from positive consequences scheme is defined by a Premise: “If 
is brought about, good consequences will (plausibly) occur” and Conclusion: “Therefore,  should
be brought about”, with the following critical questions (CQs): CQ1: “How strong is the likelihood
that the cited consequences will (may, must) occur?”; CQ2: “What evidence supports the claim that
the cited consequences will occur and is it suficient to support the strength of the claim adequetly?” ;
“CQ3: Are there opposite consequences (bad as opposed to good) that should be taken into account?”.
      </p>
      <p>
        Wagemans proposed the Periodic Table of Arguments (PTA) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] (see Figure 1 for the first
iteration of the table), which is based on an a priori constrained set of possible combinations
between diferent characterisations of argument: subject vs predicate arguments, first vs second
order arguments, and argument substance. Subject arguments are arguments whose premise
and conclusion have the same predicate but diferent subject (e.g. “Abortion should be illegal,
because murder is illegal.”), whereas Predicate arguments are arguments whose premise and
conclusion share the same subject but have diferent predicates (e.g. “The death penalty should
be abolished, because the death penalty carries the risk of ruining innocent people lives.”).
Firstorder arguments contain simple statements which cannot be split further while Second-order
arguments are epistemological in nature and, containing at least one complex statement whose
subject can be broken down, they can embed first order arguments (e.g., “We should wear masks
in public because WHO suggests it.”). Finally, the argument’s statements are categorised as
propositions of policy (if they express that an act should be performed), of value (if they contain
an evaluative judgment based on a definition or assessment criteria, such as ethical judgements),
or of fact (if their veracity can be verified empirically). We note that the two taxonomies are not
incompatible and the PTA can incorporate existing schemes, for example Walton’s argument
from sign corresponds to 1-pre-FF in the PTA, as can be seen in Figure 1.
      </p>
      <p>
        Several works have focused on classifying arguments based on the argument scheme they
instantiate using features extracted from text [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] proposed guidelines for annotating
argument schemes using a taxonomic hierarchy of schemes and the semantic properties of
premises/claims, while [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] advocated for the creation of argument scheme templates
representing clusters of schemes. Visser et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] annotated election debates using Walton’s schemes
and Wagemans’s PTA and provided an overview of the correspondence between the results
obtained with the two taxonomies. In contrast, our aim is to reconcile the two approaches of
classifying schemes, leveraging the strengths of both in order to develop a hybrid classification
that can be applied to ethical debates so as to provide transparent and rational reasoning.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. From Argument Classification to Reconciling Taxonomies</title>
      <p>
        We make first steps towards reconciling the two taxonomies by classifying NL arguments
using Walton and Wagemans, following the method of Visser et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] to manually annotate
arguments, but we focus on ethical debates (e.g. “Pro-life vs Pro-choice: Should abortion be
legal?”, “Should an Artificial General Intelligence be created?”, “Should all humans be vegans?”).
The most common schemes identified are: argument from consequences, argument from values,
argument from analogy, argument from example, practical reasoning, while the majority of
arguments we identify using Wagemans’ classification are first-order, predicate arguments.
Classifying an argument from the debate Pro-life vs Pro-choice. Consider argument  :
Access to legal abortion improves the health and safety of pregnant people. In our analysis, we
ifrst determine that argument  is an enthymeme and assume the complete argument to be
 ′: Access to legal abortion improves the health and safety of pregnant people, so pregnant people
should have the right to choose abortion.
      </p>
      <p>
        To annotate with Walton’s taxonomy, we use the Argument Scheme Key (ASK), a series of
disjunctive choices based on the distinctive features of argument schemes which also groups
scheme types that share particular characteristics [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The ASK path used to classify argument
 ′ is as follows, with the answer in brackets: Argument relies on a source’s opinion or character
(No); Conclusion is about a course of action (Yes); Argument focuses on the outcome of the action
(Yes); Conclusion promotes a positive outcome (Yes); Course of action assists someone else (No);
Course of action promotes a goal (Yes), resulting in an argument from positive consequences.
      </p>
      <p>To annotate with Wagemans’ taxonomy, we consider the three characterisations of argument.
In particular, we determine that  ′ is a first-order, predicate argument as the premise and the
conclusion share the same subject (i.e. “access to legal abortion”). Note that  ′ needs to be
rephrased slightly in order to match the definition of a predicate argument. Lastly, we observe
that the conclusion of  ′ is a proposition of policy (“pregnant people should have the right …”),
while the premise is a fact (“legal access improves the health and safety of pregnant people”),
thus the argument is of type 1-pre-PF, equivalent to a pragmatic argument.</p>
      <p>
        This example ofers insights into our approach towards a hybrid taxonomy: firstly, observing
the co-occurrences of argument schemes in both classification systems allows us to detect
correspondences between the two in order to reconcile them. For example, Walton’s argument
from positive consequences is often classified as 1-pre-PF using Wagemans’ PTA, which was
also observed in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Secondly, comparing and contrasting the annotation guidelines of each
taxonomy helps us reflect on them and their usefulness. For instance, deciding if an argument
is first or second order is a criterion in both taxonomies, which indicates that this distinction is
necessary and should be included in the criteria of classification in our hybrid taxonomy.
      </p>
      <p>
        We also take inspiration from [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] that developed the hybrid scheme argument from action,
which (partly) incorporates the schemes argument from positive/negative consequences, argument
from positive/negative values, and practical reasoning. Grouping schemes in this manner can be
a helpful tool in decreasing the number of argument schemes considered and a step towards
developing our hybrid classification. Thus, we also consider argument  ′ as an argument from
action, although the scheme is not part of the two taxonomies analysed.
      </p>
      <p>
        Linking arguments using critical questions. Consider argument  : A vegan society would
cause the least harm to wildlife, so all humans should go vegan and argument  : The risk of death of
wildlife increases during the transport of food, especially when the vegan food travels for thousands
of miles. Argument  is an argument from action which has 16 critical questions [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], one of
them being CQ: “Assuming the circumstances, does the action have the stated consequences?”. We
observe that argument  can serve as an answer to the CQ of argument  and can be seen as a
counter-argument to it. In addition, argument  is as an argument from danger.
      </p>
      <p>
        An important step in reconciling Walton’s argument schemes and Wagemans’ PTA is to
identify the strengths of the two taxomies. The former is more comprehensive, while the latter
is more practically useful and can be seen as an intermediate between the semantic detail of
Walton and the relation between premise-conclusion used in argument mining approaches.
Critical questions represent a key aspect of argument schemes, as they can be pointers to
counter-arguments or supporting arguments, since the argument answering a critical question
attacks/supports the original argument by virtue of the critical question; we aim to include
them in our hybrid classification and apply them to ethical debates. Part of our reconciliation
process is also to decrease the number of argument schemes. Indeed, the next step of our study
will focus on exploring whether other schemes can be grouped together, similarly to argument
from action [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. The clustering nature of the ASK algorithm along with the criteria of the PTA
can be used to create a reduced, but still broad, number of argument types.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>This paper describes an initial step towards realising the long-term research goal of supporting
dialogue between humans and between humans and AI systems. We focus on argument
annotation using Walton’s argument schemes and critical questions as well as Wagemans’
Periodic Table of Argument, in order to develop a new, evolved framework, specialised in
ethical reasoning. We believe this is an important first step in identifying schemes and scheme
taxonomies specialised for ethical reasoning and that can support dialogical scafolding of
both human and artificial agent reasoning. Our approach goes beyond standard annotation
approaches for argument mining and proposes a semantically richer approach to argument
classification through tools of argumentation.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Rogers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kovaleva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rumshisky</surname>
          </string-name>
          ,
          <article-title>A primer in BERTology: What we know about how BERT works, Transactions of the Association for Computational Linguistics 8 (</article-title>
          <year>2020</year>
          )
          <fpage>842</fpage>
          -
          <lpage>866</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Modgil</surname>
          </string-name>
          ,
          <article-title>Dialogical scafolding for human and artificial agent reasoning</article-title>
          ,
          <source>in: Proceedings of the 5th International Workshop on Artificial Intelligence and Cognition</source>
          ,
          <string-name>
            <surname>AIC</surname>
          </string-name>
          ,
          <year>2017</year>
          , pp.
          <fpage>58</fpage>
          -
          <lpage>71</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Matthias</surname>
          </string-name>
          ,
          <article-title>The responsibility gap: Ascribing responsibility for the actions of learning automata</article-title>
          ,
          <source>Ethics and information technology 6</source>
          (
          <year>2004</year>
          )
          <fpage>175</fpage>
          -
          <lpage>183</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hadfield-Menell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Dragan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Abbeel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russell</surname>
          </string-name>
          ,
          <article-title>Cooperative inverse reinforcement learning</article-title>
          ,
          <source>CoRR abs/1606</source>
          .03137 (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lawrence</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Reed</surname>
          </string-name>
          ,
          <article-title>Argument mining: A survey</article-title>
          ,
          <source>Computational Linguistics</source>
          <volume>45</volume>
          (
          <year>2019</year>
          )
          <fpage>765</fpage>
          -
          <lpage>818</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Walton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Reed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Macagno</surname>
          </string-name>
          , Argumentation schemes, Cambridge University Press,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J. H. M.</given-names>
            <surname>Wagemans</surname>
          </string-name>
          ,
          <article-title>Constructing a periodic table of arguments</article-title>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V. W.</given-names>
            <surname>Feng</surname>
          </string-name>
          , G. Hirst,
          <article-title>Classifying arguments by scheme</article-title>
          ,
          <source>in: The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>987</fpage>
          -
          <lpage>996</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lawrence</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Reed</surname>
          </string-name>
          ,
          <article-title>Argument mining using argumentation scheme structures</article-title>
          ,
          <source>in: Proceedings of Computational Models of Argument (COMMA)</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>379</fpage>
          -
          <lpage>390</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E.</given-names>
            <surname>Musi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Muresan</surname>
          </string-name>
          ,
          <article-title>Towards feasible guidelines for the annotation of argument schemes</article-title>
          ,
          <source>in: Proceedings of the Third Workshop on Argument Mining</source>
          ,
          <source>ArgMining@ACL</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>82</fpage>
          -
          <lpage>93</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Liga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmirani</surname>
          </string-name>
          ,
          <article-title>Argumentation schemes as templates? Combining bottom-up and top-down knowledge representation</article-title>
          ,
          <source>in: Proceedings of the 20th CMNA workshop</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>51</fpage>
          -
          <lpage>56</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Visser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lawrence</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Reed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wagemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Walton</surname>
          </string-name>
          , Annotating argument schemes,
          <source>Argumentation</source>
          <volume>35</volume>
          (
          <year>2021</year>
          )
          <fpage>101</fpage>
          -
          <lpage>139</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>K.</given-names>
            <surname>Atkinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. J. M.</given-names>
            <surname>Bench-Capon</surname>
          </string-name>
          ,
          <article-title>Action-based alternating transition systems for arguments about action</article-title>
          ,
          <source>in: Proceedings of the 32nd AAAI</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>29</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>