<!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>Web-based Mass Argumentation in Natural Language</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Adam Wyner</string-name>
          <email>adam@wyner.info</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tom van Engers</string-name>
          <email>vanengers@uva.nl</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Liverpool</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Leibniz Center for Law, University of Amsterdam</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>We provide a novel framework and implementation which integrates tools to support the acquisition of mass, distributive, incremental, dynamic, argumentative knowledge in natural language. With the Attempto Controlled English (ACE) system, natural language statements are automatically translated to a machine processable form. A discussion forum allows the speci cation of argumentation theoretic relationships among statements. Statements and their relationships are input to a formal, implemented argumentation system, which calculates inferences from asserted premises.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        There exist robust systems for building ontologies and
instantiated knowledge bases using natural language input,
which in part help to overcome the knowledge bottleneck
of translating human knowledge, expressed in natural
language, into machine processable information. However,
ontologies and knowledge bases may be debatable and
inconsistent. Formal argumentation systems have been developed to
reason with inconsistent, defeasible knowledge bases [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Yet, such systems are abstract; translating arguments
which are expressed in natural language into formal
argumentation frameworks is labour and knowledge intensive.
A tool which supports users to build and argue about
ontologies and knowledge bases in natural language could nd
widespread application in important domains. Among many
possible application areas, we consider public policy-making,
wherein members of the public contribute statements on
policy [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. While current tools, e.g. argument visualisation
DebateGraph1 or forums Have Your Say2, allow web-based
1http:==debategraph.org
2http:==www.bbc.co.uk=news=have your say=
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for profit or commercial advantage and that copies
bear this notice and the full citation on the first page. To copy otherwise, to
republish, to post on servers or to redistribute to lists, requires prior specific
permission and/or a fee.
      </p>
      <p>
        International Conference on Knowledge Engineering and Knowledge
Management 2010 Lisbon, Portugal
Copyright 20XX ACM X-XXXXX-XX-X/XX/XX ...$10.00.
contributions by the public, they do not fully analyse the
linguistic content of the contributions nor structure the
argumentative relationships among the statements, losing
information and hindering automated reasoning. In this paper,
we outline a natural language interface tool to formal
argumentation systems using the Attempto Controlled English
system (ACE)3, integrated with a discussion forum to
specify statement relationships, which then outputs an argument
graph on which reasoning can be executed; the theoretical
framework is detailed in [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. In the following, we brie y
discuss an example and the implemented components.
2.
      </p>
      <p>
        EXAMPLE
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] provide a normalised example that has been adapted
from the BBC's Have Your Say online discussion of the
question Should people be paid to recycle? In normalising the
sentences, we have followed the lexical and syntactic
conventions of ACE. The have a sample from the 19 statements:
p5: If a household pays a tax for the household's
garbage then the tax is unfair to the household.
p6: Every household should pay an equal
portion of the sum of the tax for the household's
garbage. p7: No household which receives a
bene t which is paid by a council recycles the
household's garbage. p8: Every household which does
not receive a bene t which is paid by a
council supports a household which receives a bene t
which is paid by a council.
      </p>
      <p>The statements p6, p7, and p8 are should be taken as
supports for the claim in p5.
3.</p>
    </sec>
    <sec id="sec-2">
      <title>SYSTEM OUTLINE</title>
      <p>
        We outline an implemented system which is theoretically
described in [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]; the components and ow through are
represented in Figure 1. We give illustrative fragments of
the components of the system.
      </p>
      <sec id="sec-2-1">
        <title>A Discussion Forum.</title>
        <p>We have a user and a web-based threaded discussion
forum (which uses PhP, MySQL, and XML). As with
standard threaded forums, the user can read statements, select
a statement to respond to, and enter a new statement. In
addition to entering the statement itself, the user selects
the argumentation theoretic relationship between the
input statement and previous statements on the forum, where
3http:==attempto.i .uzh.ch
the choices are among contradiction, premise, or conclusion.
These relationships are also stored in the MySQL database.
Figure 2 shows the statements (5)-(8) in the forum.
ACE.</p>
        <p>
          In entering a new statement, an ACE editing window opens
which provides a predictive editor that guides the user to
input well-formed statements using the ACE grammar and
lexicon. A controlled natural language is a formal yet
expressive subset of a natural language with a restricted lexicon,
restricted range of syntactic forms, and correlated semantic
interpretations. After entering the statement, it is parsed
and semantically interpreted as a statement of First-order
Logic; the parse and semantic interpretation is stored in
an XML representation in the MySQL database for further
processing. For instance, inputting \Every household
creates some garbage." automatically generates a First-order
Logic representation:
8 x [[household'(x)] ! 9 y [ garbage'(y) ^ create'(x,y) ]]
As reported in [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], the sentences in the example are all parsed
and given accurate semantic interpretations in ACE.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>A Formal Argumentation System.</title>
        <p>
          The statements in their relationships are then used to
generate an argumentation graph such that, given asserted premises,
one can infer conclusions, which are also stored in the MySQL
database. In Figure 3, from the premises p6, p7, and p8, we
infer with a good likelihood (indicated by +.53), that p5
follows. The assertions and premises can, in a policy
discussion, be taken as the core policy statements. While here we
have used [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], other argumentation formalisms are possible
[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
4.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>DISCUSSION</title>
      <p>With respect to the database of statements, relationships,
assertions, and inferences, one can apply further processes
such as information extraction and querying. In future work,
we intend to extend the expressivity of ACE to cover deontic
notions (e.g. obligation), to support interactive feedback for
questions on implicit information, to give greater
interactive guidance on well-formedness of expressions, to leverage
ontological information, and to enrich argumentative
information. Finally, we will examine the applicability of the
system to a range of other domains in the social and
empirical sciences.</p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgements</title>
      <p>We thank the European Commission for supporting this
research in the IMPACT Project (Integrated Method for
Policy making using Argument modeling and Computer
assisted Text analysis) FP7 Grant Agreement No. 247228. We
thank Kiavash Bahreini for system development and
graphics.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P. M.</given-names>
            <surname>Dung</surname>
          </string-name>
          .
          <article-title>On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games</article-title>
          .
          <source>Arti cial Intelligence</source>
          ,
          <volume>77</volume>
          (
          <issue>2</issue>
          ):
          <volume>321</volume>
          {
          <fpage>358</fpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gordon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Prakken</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Walton</surname>
          </string-name>
          .
          <article-title>The carneades model of argument and burden of proof</article-title>
          .
          <source>Arti cial Intelligence</source>
          ,
          <volume>171</volume>
          :
          <fpage>875</fpage>
          {
          <fpage>896</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Macintosh</surname>
          </string-name>
          .
          <article-title>Moving toward "intelligent" policy development</article-title>
          .
          <source>IEEE Intelligent Systems</source>
          ,
          <volume>24</volume>
          (
          <issue>5</issue>
          ):
          <volume>79</volume>
          {
          <fpage>82</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Wyner</surname>
          </string-name>
          , T. van Engers, and
          <string-name>
            <given-names>K.</given-names>
            <surname>Bahreini</surname>
          </string-name>
          .
          <article-title>From policy-making statements to rst-order logic</article-title>
          .
          <source>In Proceedings of International Conference on Electronic Government and the Information Systems Perspective (EGOVIS</source>
          <year>2010</year>
          ), Lecture Notes in Computer Science. Springer Verlag,
          <year>2010</year>
          . To appear.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Wyner</surname>
          </string-name>
          , T. van Engers,
          <article-title>and</article-title>
          <string-name>
            <surname>A. Hunter.</surname>
          </string-name>
          <article-title>Working on the argument pipeline: Through ow issues between natural language argument, instantiated arguments, and argumentation frameworks</article-title>
          .
          <source>In Proceedings of the Workshop on Computational Models of Natural Argument</source>
          ,
          <year>2010</year>
          . To appear.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>