Abstract
Argumentation mining aims at automatically extracting natural language arguments from textual documents. In the last years, it has become a hot topic due to its potential in processing information originating from the Web in innovative ways. In this paper, we propose to apply the argument mining pipeline to the text exploration task. First, starting from the arguments put forward in online debates, we introduce bipolar entailment graphs to predict the relation among the textual arguments, i.e., entailment or non entailment relation. Second, we exploit the well know formalism called abstract dialectical frameworks to define acceptance conditions answering the needs of the text exploration task. The evaluation of the proposed approach shows its feasibility.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
As discussed also in the keynote talk of the Joint Symposium on Semantic Processing (http://jssp2013.fbk.eu/).
- 2.
- 3.
In the two-way classification task, contradiction and unknown relations are collapsed into a unique relation, i.e. non entailment.
- 4.
[13] provides an overview of the recent advances in TE.
- 5.
The Recognizing Textual Entailment (RTE) data are not suitable for our goal, since the pairs are not interconnected (i.e. they cannot be transformed into argumentation graphs).
- 6.
- 7.
- 8.
- 9.
The F-measure is a measure of accuracy. It considers both the precision and the recall of the test to compute the score.
- 10.
Complexity results for ADFs have been studied by [6].
- 11.
- 12.
We refer the interested reader to the results of the First International Competition on Computational Models of Argumentation [33].
- 13.
References
Amgoud, L., Prade, H.: Can AI models capture natural language argumentation? IJCINI 6(3), 19–32 (2012)
Bar-Haim, R., Dagan, I., Greental, I., Shnarch, E.: Semantic inference at the lexical-syntactic level. In: AAAI, pp. 871–876 (2007)
Berant, J., Dagan, I., Adler, M., Goldberger, J.: Efficient tree-based approximation for entailment graph learning. In: ACL, vol. 1, pp. 117–125 (2012)
Berant, J., Dagan, I., Goldberger, J.: Global learning of focused entailment graphs. In: ACL, pp. 1220–1229 (2010)
Brewka, G., Strass, H., Ellmauthaler, S., Wallner, J.P., Woltran, S.: Abstract dialectical frameworks revisited. In: IJCAI (2013)
Brewka, G., Woltran, S.: Abstract dialectical frameworks. In: KR (2010)
Brewka, G., Woltran, S.: GRAPPA: a semantical framework for graph-based argument processing. In: Schaub, T., Friedrich, G., O’Sullivan, B. (eds.) ECAI 2014-21st European Conference on Artificial Intelligence, 18–22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014). Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 153–158. IOS Press, August 2014. http://dx.doi.org/10.3233/978-1-61499-419-0-153
Cabrio, E., Villata, S.: Natural language arguments: a combined approach. In: ECAI, pp. 205–210 (2012)
Cabrio, E., Villata, S.: A natural language bipolar argumentation approach to support users in online debate interactions. Argument Comput. 4(3), 209–230 (2013)
Carenini, G., Moore, J.D.: Generating and evaluating evaluative arguments. Artif. Intell. 170(11), 925–952 (2006)
Cayrol, C., Lagasquie-Schiex, M.C.: Bipolarity in argumentation graphs: towards a better understanding. Int. J. Approx. Reason. 54(7), 876–899 (2013)
Chesñevar, C.I., Maguitman, A.: An argumentative approach to assessing natural language usage based on the web corpus. In: ECAI, pp. 581–585 (2004)
Dagan, I., Dolan, B., Magnini, B., Roth, D.: Recognizing textual entailment: rational, evaluation and approaches. Nat. Lang. Eng. (JNLE) 15(4), 1–17 (2009)
Dung, P.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)
Dunne, P.E., Hunter, A., McBurney, P., Parsons, S., Wooldridge, M.: Weighted argument systems: basic definitions, algorithms, and complexity results. Artif. Intell. 175(2), 457–486 (2011)
Feng, V.W., Hirst, G.: Classifying arguments by scheme. In: ACL, pp. 987–996 (2011)
Gabbriellini, S., Torroni, P.: NetArg: an agent-based social simulator with argumentative agents. In: AAMAS, pp. 1365–1366 (2013)
Gabbriellini, S., Santini, F.: A micro study on the evolution of arguments in amazon.com’s reviews. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds.) PRIMA 2015. LNCS (LNAI), vol. 9387, pp. 284–300. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25524-8_18
Gabbriellini, S., Torroni, P.: Large scale agreements via microdebates. In: Ossowski, S., Toni, F., Vouros, G.A. (eds.) Proceedings of the First International Conference on Agreement Technologies, AT 2012, Dubrovnik, Croatia, 15–16 October 2012. CEUR Workshop Proceedings, vol. 918, pp. 366–377. CEUR-WS.org (2012). http://ceur-ws.org/Vol-918/111110366.pdf
Gabbriellini, S., Torroni, P.: Arguments in social networks. In: Gini, M.L., Shehory, O., Ito, T., Jonker, C.M. (eds.) International conference on Autonomous Agents and Multi-agent Systems, AAMAS 2013, Saint Paul, MN, USA, 6–10 May 2013, pp. 1119–1120. IFAAMAS (2013). http://dl.acm.org/citation.cfm?id=2485100
Gordon, T., Prakken, H., Walton, D.: The carneades model of argument and burden of proof. Artif. Intell. 171(10–15), 875–896 (2007)
Heras, S., Atkinson, K., Botti, V.J., Grasso, F., Julián, V., McBurney, P.: Research opportunities for argumentation in social networks. Artif. Intell. Rev. 39(1), 39–62 (2013)
Kouylekov, M., Negri, M.: An open-source package for recognizing textual entailment. In: ACL (System Demonstrations), pp. 42–47 (2010)
Leite, J., Martins, J.: Social abstract argumentation. In: IJCAI, pp. 2287–2292 (2011)
Lin, D., Pantel, P.: Discovery of inference rules for question answering. Nat. Lang. Eng. 7, 343–360 (2001)
Lippi, M., Torroni, P.: Context-independent claim detection for argument mining. In: Yang, Q., Wooldridge, M. (eds.) Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25–31 July, pp. 185–191. AAAI Press (2015). http://ijcai.org/papers15/Abstracts/IJCAI15-033.html
Mehdad, Y., Carenini, G., Ng, R.T., Joty, S.R.: Towards topic labeling with phrase entailment and aggregation. In: HLT-NAACL, pp. 179–189 (2013)
Moens, M.F., Boiy, E., Palau, R.M., Reed, C.: Automatic detection of arguments in legal texts. In: ICAIL, pp. 225–230 (2007)
Rahwan, I., Banihashemi, B., Reed, C., Walton, D., Abdallah, S.: Representing and classifying arguments on the semantic web. Knowl. Eng. Rev. 26(4), 487–511 (2011)
Reed, C., Rowe, G.: Araucaria: software for argument analysis, diagramming and representation. Int. J. Artif. Intell. Tools 13(4), 961–980 (2004)
Stern, A., Dagan, I.: A confidence model for syntactically-motivated entailment proofs. In: RANLP, pp. 455–462 (2011)
Stern, A., Dagan, I.: Biutee: a modular open-source system for recognizing textual entailment. In: ACL (Demo), pp. 73–78 (2012)
Thimm, M., Villata, S.: System descriptions of the first international competition on computational models of argumentation (ICCMA 2015). CoRR abs/1510.05373 (2015). http://arxiv.org/abs/1510.05373
Verheij, B.: Argumed - a template-based argument mediation system for lawyers and legal knowledge based systems. In: JURIX, pp. 113–130 (1998)
Walton, D., Reed, C., Macagno, F.: Argumentation Schemes. Cambridge University Press, Cambridge (2008)
Wyner, A., van Engers, T.: A framework for enriched, controlled on-line discussion forums for e-government policy-making. In: eGov (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Cabrio, E., Villata, S. (2017). Natural Language Argumentation for Text Exploration. In: van den Herik, J., Filipe, J. (eds) Agents and Artificial Intelligence. ICAART 2016. Lecture Notes in Computer Science(), vol 10162. Springer, Cham. https://doi.org/10.1007/978-3-319-53354-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-53354-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53353-7
Online ISBN: 978-3-319-53354-4
eBook Packages: Computer ScienceComputer Science (R0)