Argument mining based on a structured database and its usage in an intelligent tutoring environment

Knowledge and Information Systems

Volumn 30, Issue 1, 2012, Pages 213-246

  Abbas, Safia ^a   Sawamura, Hajime ^b  

^a Ain Shams University   (Egypt)

^b NIIGATA UNIVERSITY   (Japan)

Author keywords

Argumentation; Intelligent tutoring environment; Mining techniques; Structure databases

Indexed keywords

EID: 84855540730     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-010-0371-3     Document Type: Article

References (35)

1. Abbas S, Sawamura H (2008) A first step towards argument mining and its use in arguing agents and its. In: 12th international conference on knowledge-based and intelligent information and engineering systems (KES), Zagreb, Croatia, Springer, pp 149-157.
2. Abbas S, Sawamura H (2008) Towards argument mining using relational argument database. In: The second international workshop on Juris-informatics (JURISIN), Asahikawa Convention Bureau, Hokkaido, Japan, pp 22-31.
3. Abbas S, Sawamura H (2009) Mining impact on argument learning environment and arguing agents. In: The third international workshop on Juris-Informatics (JURISIN 2009), JSAI, Tokyo, Japan, pp 3-14.
4. Agrawal R, Srikant R (1994) Fast algorithms for mining rules. In: The 20th VLDB conference Santiago, Chile.
5. Chesnevar C, McGinnis J, Modgil S, Rahwan I (2006) Towards an argument interchange format. In: The knowledge engineering review. Cambridge University Press.
6. Baloian N, Motelet O, Pino A (2008) Taking advantage of metadata semantics: the case of learning-object-based lesson graphs. Knowl Inf Syst J 20: 323-348.
7. Cao B, Badia A (2009) Exploiting maximal redundancy to optimize sql queries. Knowl Inf Syst J 20: 187-220.
8. Chi Y, Muntz R (2001) Frequent subtree mining-an overview. Fundamenta Informaticae. pp 1001-1038.
9. Conrad J, Schilder F (2007) Opinion mining in legal blogs. In: ICAILć607 palo alto, California, USA, pp 231-236, June 4-8.
10. Gordan F, Walton D (2006) The carneades argumentation framework: using presumptions and exceptions to model critical questions. In: 6th computational models of natural argument workshop (CMNA), European conference on artificial intelligence (ECAI), Italy, pp 5-13.
11. Godden M, Walton D (2006) Argument from expert opinion as legal evidence: critical questions and admissibility criteria of expert testimony in the American legal system. Juris R 19: 261-286.
12. Gordan F, Walton D (2006) The carneades argumentation framwork. In: Computational models of argument (COMMA06), IOS press, vol 144, pp 195-207.
13. Katzav J, Reed C, Rowe G (2003) Argument research corpus. In: Huget M-P (ed) Communication in multiagent systems, Lecture notes in computer science, vol 2650, Springer, Berlin, pp 269-283.
14. Lin X, Zhou A, Luo H, Fan J, Bertino E (2008) A distributed approach to enabling privacy-preserving model-based classifier training. Knowl Inf Syst J. pp 157-185.
15. Lynch C, Ashley K (2009) Toward assessing law students' argument diagrams. In: The 12th international conference on artificial intelligence and law, Association for Computing Machinery, New York, pp 222-223.
16. Lynch C, Ashley K, Pinkwart N, Aleven V (2007) Learning by diagramming supreme court oral arguments. In: The 11th international conference of artificial intelligence and law, ACM Press, pp 271-275.
17. Macagno F, Walton D (2006) Argumentative reasoning patterns. In: Proceeding of 6th CMNA (Computational models of natural argument) workshop, ECAI (European conference on aetificial intelligence), Rivadel Garda, Italy, Trento, Italy, University of Trento. pp 48-51.
18. McBurney P, Parsons S (2003) Dialogue game protocols. In: Practical applications in language corpora.
19. Moens M, Boiy E, Palau R, Reed C (2007) Automatic detection of arguments in legal texts. In: ICAIL07 Palo Alto, California USA, pp 225-230, June 4-8.
20. Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Tenth ACM SIGKDD international conference on knowledge discovery and data mining, USA, pp 647-652.
21. Prakken H, Reed C, Walton D (2005) Dialogues about the burden of proof. In: Proceedings of the 10th international conference on artificial intelligence and law (ICAIL), ACM Press, New York NY, USA.
22. Prakken H, Vreeswijk G (2002) Logical systems for defeasible argumentation. In: Gabbay D, Guenther F (eds) Handbook of philosophical logic. Kluwer, NY, pp 219-318.
23. Rahwan I, Zablith F, Reed C (2007) The foundation for a world wide argument web. In: Artificial intelligence conference (AAAI). published in the Artificial Intelligence Journal, April 04.
24. Rahwan I, Sakeer P (2006) Representing and querying arguments on semantic web. In: Dunne PE, Bench-Capon TJM (eds) Computational models of argument. IOS Press, Amsterdam.
25. Rowe G, Reed C, Katzav J (2003) Araucaria: making up argument. In: European conference on computing and philosophy.
26. Reed C, Rowe G (2004) Araucaria: software for argument analysis, diagramming and representation. Int J Artif Intell Tools 13: 983.
27. Reed C, Rowe G (2005) Translating toulmin diagrams: theory neutrality in argument representation. Argumentation J 19: 267-286.
28. Reed C, Walton D, Macagno F (2008) Argumentation schemes. Cambridge University Press, Cambridge.
29. Rowe G, Reed C, Katzav J (2003) Araucaria: making up argument. In: European conference on computing and philosophy.
30. Walton D (1996) Argumentation schemes for presumptive reasoning. In: Lawrence Erlbaum, vol 13, p 236.
31. Walton D (2006) Argument from appearance: a new argumentation scheme. Logique et Analyse 195: 319-340.
32. Walton D, Hansen H (2006) Fundamentals of critical argumentation. Cambridge University Press, Cambridge.
33. Walton D, Rowe G, Macagno F, Reed C (2006) Araucaria as a tool for diagramming arguments in teaching and studying philosophy. Teach Philos 29: 111-124.
34. Wang K, Zeng X, Pei J, Li J (2008) Pads: a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining. Knowl Inf Syst J 20: 375-391.
35. Zaki M (2005) Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans Knowl Data Eng 17: 1021-1035.