![]() Liga, Davide ![]() in Intelligent Systems and Applications (2022, August 31) Detailed reference viewed: 21 (0 UL)![]() Liga, Davide ![]() Doctoral thesis (2022) This Thesis is composed of a selection of studies realized between 2019 and 2022, whose aim is to find working methodologies of Artificial Intelligence (AI) and Machine Learning for the detection and ... [more ▼] This Thesis is composed of a selection of studies realized between 2019 and 2022, whose aim is to find working methodologies of Artificial Intelligence (AI) and Machine Learning for the detection and classification of patterns and rules in argumentative and legal texts. We define our approach as “hybrid”, since different methods have been employed combining symbolic AI (which involves “top-dow” structured knowledge) and sub-symbolic AI (which involves “bottom-up” data-driven knowledge). The first group of these works was dedicated to the classification of argumentative patterns. Following the Waltonian model of argument (according to which arguments are composed by a set of premises and a conclusion), and the theory of Argumentation Schemes, this group of studies was focused on the detection of argumentative evidences of support and opposition. More precisely, the aim of these first works was to show that argumentative patterns of opposition and support could be classified at fine-grained levels and without resorting to highly engineered features. To show this, we firstly employed methodologies based on Tree Kernel classifiers and TFIDF. In these experiments, we explored different combinations of Tree Kernel calculation and different data structures (i.e., different tree structures). Also, some of these combinations employs a hybrid approach where the calculation of similarity among trees is influenced not only by the tree structures but also by a semantic layer (e.g. those using “smoothed” trees and “compositional” trees). After the encouraging results of this first phase, we explored the use of a new methodology which was deeply changing the NLP landscape exactly in that year, fostered and promoted by actors like Google, i.e. Transfer Learning and the use of language models. These newcomer methodologies markedly improved our previous results and provided us with stronger NLP tools. Using Transfer Learning, we were also able to perform a Sequence Labelling task for the recognition of the exact span of argumentative components (i.e. claims and premises), which is crucial to connect the sphere of natural language to the sphere of logic. The last part of this work was finally dedicated to show how to use Transfer Learning for the detection of rules and deontic modalities. In this case, we tried to explore a hybrid approach which combines structured knowledge coming from two LegalXML formats (i.e., Akoma Ntoso and LegalRuleML) with sub-symbolic knowledge coming from pre-trained (and then fine-tuned) neural architectures. [less ▲] Detailed reference viewed: 30 (6 UL)![]() ; Liga, Davide ![]() in Electronic Government and the Information Systems Perspective: 11th International Conference, EGOVIS 2022 (2022) Detailed reference viewed: 14 (0 UL)![]() ; ; Liga, Davide ![]() in Legal Knowledge and Information Systems (2021) This paper presents an AI use-case developed in the project “Study on legislation in the era of artificial intelligence and digitization” promoted by the EU Commission Directorate-General for Informatics ... [more ▼] This paper presents an AI use-case developed in the project “Study on legislation in the era of artificial intelligence and digitization” promoted by the EU Commission Directorate-General for Informatics. We propose a hybrid technical framework where AI techniques, Data Analytics, Semantic Web approaches and LegalXML modelisation produce benefits in legal drafting activity. This paper aims to classify the corrigenda of the EU legislation with the goal to detect some criteria that could prevent errors during the drafting or during the publication process. We use a pipeline of different techniques combining AI, NLP, Data Analytics, Semantic annotation and LegalXML instruments for enriching the non-symbolic AI tools with legal knowledge interpretation to offer to the legal experts. [less ▲] Detailed reference viewed: 13 (0 UL)![]() Liga, Davide ![]() in Logic and Argumentation (2020) This study is an approach to encompass uncertainty in the well-known Argumentation Scheme from Negative Consequences and in the more recent “Basic Slippery Slope Argument” proposed by Douglas Walton. This ... [more ▼] This study is an approach to encompass uncertainty in the well-known Argumentation Scheme from Negative Consequences and in the more recent “Basic Slippery Slope Argument” proposed by Douglas Walton. This work envisages two new kinds of uncertainty that should be taken into account, one related to time and one related to the material relation between premises and conclusion. Furthermore, it is argued that some modifications to the structure of these Argumentation Schemes or to their Critical Questions could facilitate the process of Knowledge Extraction and modeling from these two argumentative patterns. For example, the study suggests to change the premises of the Basic Slippery Slope related to the Control and the Loss of Control. [less ▲] Detailed reference viewed: 7 (0 UL)![]() Liga, Davide ![]() in Proceedings of the 20th Workshop on Computational Models of Natural Argument (2020) This paper describes a long-term research goal which aims at creating a middleware interface between Argumentation Schemes and natural language. This idea comes from the need to face some challenges ... [more ▼] This paper describes a long-term research goal which aims at creating a middleware interface between Argumentation Schemes and natural language. This idea comes from the need to face some challenges related to the automatic extraction of Argumentation Schemes from Nat- ural Language: for example the ability to extract Argumentation Schemes at different level of granularity. In the paper we describe how this process can be designed and how the structures of Argumentation Schemes can be modeled to this aim. [less ▲] Detailed reference viewed: 5 (0 UL)![]() Liga, Davide ![]() in Advances in Semantics and Linked Data: Joint Workshop Proceedings from ISWC 2020 (2020) Detailed reference viewed: 25 (0 UL)![]() Liga, Davide ![]() in Proceedings of the 20th Workshop on Computational Models of Natural Argument (2020) Detailed reference viewed: 7 (0 UL)![]() Liga, Davide ![]() in Proceedings of the 6th Workshop on Argument Mining (2019) The purpose of this study is to deploy a novel methodology for classifying different argumentative support (supporting evidences) in arguments, without considering the context. The proposed methodology is ... [more ▼] The purpose of this study is to deploy a novel methodology for classifying different argumentative support (supporting evidences) in arguments, without considering the context. The proposed methodology is based on the idea that the use of Tree Kernel algorithms can be a good way to discriminate between different types of argumentative stances without the need of highly engineered features. This can be useful in different Argumentation Mining sub-tasks. This work provides an example of classifier built using a Tree Kernel method, which can discriminate between different kinds of argumentative support with a high accuracy. The ability to distinguish different kinds of support is, in fact, a key step toward Argument Scheme classification. [less ▲] Detailed reference viewed: 38 (1 UL)![]() Liga, Davide ![]() in CLADAG 2019 - Book of Short Papers (2019) The purpose of this study is to deploy a novel methodology for classifying argumentative support (or evidence) in arguments. The methodology shows that Tree Kernel can discriminate between different types ... [more ▼] The purpose of this study is to deploy a novel methodology for classifying argumentative support (or evidence) in arguments. The methodology shows that Tree Kernel can discriminate between different types of argumentative evidence with high scores, while keeping a good generalization. Moreover, the results of two different Tree Kernels are evaluated. [less ▲] Detailed reference viewed: 18 (0 UL)![]() Liga, Davide ![]() in ACAI 2019: Proceedings of the 2019 2nd International Conference on Algorithms, Computing and Artificial Intelligence (2019) The approach proposed in this study aims to classify argumentative oppositions. A major assumption of this work is that discriminating among different argumentative stances of support and opposition can ... [more ▼] The approach proposed in this study aims to classify argumentative oppositions. A major assumption of this work is that discriminating among different argumentative stances of support and opposition can facilitate the detection of Argument Schemes. While using Tree Kernels for classification problems can be useful in many Argument Mining sub-tasks, this work focuses on the classification of opposition stances. We show that Tree Kernels can be successfully used (alone or in combination with traditional textual vectorizations) to discriminate between different stances of opposition without requiring highly engineered features. Moreover, this study compare the results of Tree Kernels classifiers with the results of classifiers which use traditional features such as TFIDF and n-grams. This comparison shows that Tree Kernel classifiers can outperform TFIDF and n-grams classifiers. [less ▲] Detailed reference viewed: 19 (0 UL)![]() Liga, Davide ![]() in International Joint Conference on Rules and Reasoning (2019) The aim of this study is to propose an innovative methodology to classify argumentative stances in a monologic argumentative context. Particularly, the proposed approach shows that Tree Kernels can be ... [more ▼] The aim of this study is to propose an innovative methodology to classify argumentative stances in a monologic argumentative context. Particularly, the proposed approach shows that Tree Kernels can be used in combination with traditional textual vectorization to discriminate between different stances of opposition without the need of extracting highly engineered features. This can be useful in many Argument Mining sub-tasks. In particular, this work explores the possibility of classifying opposition stances by training multiple classifiers to reach different degrees of granularity. Noticeably, discriminating support and opposition stances can be particularly useful when trying to detect Argument Schemes, one of the most challenging sub-task in the Argument Mining pipeline. In this sense, the approach can be also considered as an attempt to classify stances of opposition that are related to specific Argument Schemes. [less ▲] Detailed reference viewed: 27 (1 UL)![]() ![]() ; ; Liga, Davide ![]() in Data science and social research (2017) Detailed reference viewed: 10 (0 UL) |
||