Lucas Rizzo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lucas Rizzo has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Luca Longo
Artificial Intelligence and Cognitive Load Research Lab, University College Cork, T12 K8AF Cork, Ireland
5 shared publications - Damiano Verda
Rulex Innovation Labs
2 shared publications Luca Longo
Technological University Dublin Dublin Ireland
2 shared publications- Ephrem Tibebe Mekonnen
School of Computer Science, Technological University Dublin, Dublin, Ireland
1 shared publication - Pierpaolo Dondio
Dublin City University
1 shared publication Serena Berretta
Rulex Innovation Laboratories, Genova, Italy
1 shared publication
Latest Publications
- Open Access
- 19 November 2026
- Published by Springer Nature
- p. 27-48
L2GTX: From Local to Global Time Series Explanations
- 19 November 2026
- Published by Springer Nature
- p. 27-48
Open AccessL2GTX: From Local to Global Time Series Explanations
- Open Access
- 1 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 175565-175583
Computational Argumentation and Automatic Rule-Generation for Explainable Data-Driven Modeling
- 1 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 175565-175583
Open AccessComputational Argumentation and Automatic Rule-Generation for Explainable Data-Driven Modeling
- Open Access
- 12 September 2024
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 6 (3) , 2049-2073
A Novel Integration of Data-Driven Rule Generation and Computational Argumentation for Enhanced Explainable AI
Explainable Artificial Intelligence (XAI) is a research area that clarifies AI decision-making processes to build user trust and promote responsible AI. Hence, a key scientific challenge in XAI is the development of methods that generate transparent and interpretable explanations while maintaining scalability and effectiveness in complex scenarios. Rule-based methods in XAI generate rules that can potentially explain AI inferences, yet they can also become convoluted in large scenarios, hindering their readability and scalability. Moreover, they often lack contrastive explanations, leaving users uncertain why specific predictions are preferred. To address this scientific problem, we explore the integration of computational argumentation—a sub-field of AI that models reasoning processes through defeasibility—into rule-based XAI systems. Computational argumentation enables arguments modelled from rules to be retracted based on new evidence. This makes it a promising approach to enhancing rule-based methods for creating more explainable AI systems. Nonetheless, research on their integration remains limited despite the appealing properties of rule-based systems and computational argumentation. Therefore, this study also addresses the applied challenge of implementing such an integration within practical AI tools. The study employs the Logic Learning Machine (LLM), a specific rule-extraction technique, and presents a modular design that integrates input rules into a structured argumentation framework using state-of-the-art computational argumentation methods. Experiments conducted on binary classification problems using various datasets from the UCI Machine Learning Repository demonstrate the effectiveness of this integration. The LLM technique excelled in producing a manageable number of if-then rules with a small number of premises while maintaining high inferential capacity for all datasets. In turn, argument-based models achieved comparable results to those derived directly from if-then rules, leveraging a concise set of rules and excelling in explainability. In summary, this paper introduces a novel approach for efficiently and automatically generating arguments and their interactions from data, addressing both scientific and applied challenges in advancing the application and deployment of argumentation systems in XAI.
- 12 September 2024
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 6 (3) , 2049-2073
Open AccessA Novel Integration of Data-Driven Rule Generation and Computational Argumentation for Enhanced Explainable AI
Explainable Artificial Intelligence (XAI) is a research area that clarifies AI decision-making processes to build user trust and promote responsible AI. Hence, a key scientific challenge in XAI is the development of methods that generate transparent and interpretable explanations while maintaining scalability and effectiveness in complex scenarios. Rule-based methods in XAI generate rules that can potentially explain AI inferences, yet they can also become convoluted in large scenarios, hindering their readability and scalability. Moreover, they often lack contrastive explanations, leaving users uncertain why specific predictions are preferred. To address this scientific problem, we explore the integration of computational argumentation—a sub-field of AI that models reasoning processes through defeasibility—into rule-based XAI systems. Computational argumentation enables arguments modelled from rules to be retracted based on new evidence. This makes it a promising approach to enhancing rule-based methods for creating more explainable AI systems. Nonetheless, research on their integration remains limited despite the appealing properties of rule-based systems and computational argumentation. Therefore, this study also addresses the applied challenge of implementing such an integration within practical AI tools. The study employs the Logic Learning Machine (LLM), a specific rule-extraction technique, and presents a modular design that integrates input rules into a structured argumentation framework using state-of-the-art computational argumentation methods. Experiments conducted on binary classification problems using various datasets from the UCI Machine Learning Repository demonstrate the effectiveness of this integration. The LLM technique excelled in producing a manageable number of if-then rules with a small number of premises while maintaining high inferential capacity for all datasets. In turn, argument-based models achieved comparable results to those derived directly from if-then rules, leveraging a concise set of rules and excelling in explainability. In summary, this paper introduces a novel approach for efficiently and automatically generating arguments and their interactions from data, addressing both scientific and applied challenges in advancing the application and deployment of argumentation systems in XAI.
- 21 October 2023
- Published by Springer Nature
- p. 399-414
A Novel Structured Argumentation Framework for Improved Explainability of Classification Tasks
- 21 October 2023
- Published by Springer Nature
- p. 399-414
A Novel Structured Argumentation Framework for Improved Explainability of Classification Tasks
- Open Access
- 19 July 2023
- Published by Elsevier in Software Impacts
- Vol. 17
ArgFrame: A multi-layer, web, argument-based framework for quantitative reasoning
- 19 July 2023
- Published by Elsevier in Software Impacts
- Vol. 17
Open AccessArgFrame: A multi-layer, web, argument-based framework for quantitative reasoning
- Open Access
A novel structured argumentation framework for improved explainability of classification tasks
This paper presents a novel framework for structured argumentation, named extend argumentative decision graph ($xADG$). It is an extension of argumentative decision graphs built upon Dung's abstract argumentation graphs. The $xADG$ framework allows for arguments to use boolean logic operators and multiple premises (supports) within their internal structure, resulting in more concise argumentation graphs that may be easier for users to understand. The study presents a methodology for construction of $xADGs$ and evaluates their size and predictive capacity for classification tasks of varying magnitudes. Resulting $xADGs$ achieved strong (balanced) accuracy, which was accomplished through an input decision tree, while also reducing the average number of supports needed to reach a conclusion. The results further indicated that it is possible to construct plausibly understandable $xADGs$ that outperform other techniques for building $ADGs$ in terms of predictive capacity and overall size. In summary, the study suggests that $xADG$ represents a promising framework to developing more concise argumentative models that can be used for classification tasks and knowledge discovery, acquisition, and refinement.Open AccessA novel structured argumentation framework for improved explainability of classification tasks
This paper presents a novel framework for structured argumentation, named extend argumentative decision graph ($xADG$). It is an extension of argumentative decision graphs built upon Dung's abstract argumentation graphs. The $xADG$ framework allows for arguments to use boolean logic operators and multiple premises (supports) within their internal structure, resulting in more concise argumentation graphs that may be easier for users to understand. The study presents a methodology for construction of $xADGs$ and evaluates their size and predictive capacity for classification tasks of varying magnitudes. Resulting $xADGs$ achieved strong (balanced) accuracy, which was accomplished through an input decision tree, while also reducing the average number of supports needed to reach a conclusion. The results further indicated that it is possible to construct plausibly understandable $xADGs$ that outperform other techniques for building $ADGs$ in terms of predictive capacity and overall size. In summary, the study suggests that $xADG$ represents a promising framework to developing more concise argumentative models that can be used for classification tasks and knowledge discovery, acquisition, and refinement. - Open Access
- 2 September 2022
- Published by Elsevier in Information Fusion
- Vol. 89, 537-566
Comparing and extending the use of defeasible argumentation with quantitative data in real-world contexts
- 2 September 2022
- Published by Elsevier in Information Fusion
- Vol. 89, 537-566
Open AccessComparing and extending the use of defeasible argumentation with quantitative data in real-world contexts
- Open Access
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Comparing and Extending the Use of Defeasible Argumentation with Quantitative Data in Real-World Contexts
Dealing with uncertain, contradicting, and ambiguous information is still a central issue in Artificial Intelligence (AI). As a result, many formalisms have been proposed or adapted so as to consider non-monotonicity. A non-monotonic formalism is one that allows the retraction of previous conclusions or claims, from premises, in light of new evidence, offering some desirable flexibility when dealing with uncertainty. Among possible options, knowledge-base, non-monotonic reasoning approaches have seen their use being increased in practice. Nonetheless, only a limited number of works and researchers have performed any sort of comparison among them. This research article focuses on evaluating the inferential capacity of defeasible argumentation, a formalism particularly envisioned for modelling non-monotonic reasoning. In addition to this, fuzzy reasoning and expert systems, extended for handling non-monotonicity of reasoning, are selected and employed as baselines, due to their vast and accepted use within the AI community. Computational trust was selected as the domain of application of such models. Trust is an ill-defined construct, hence, reasoning applied to the inference of trust can be seen as non-monotonic. Inference models were designed to assign trust scalars to editors of the Wikipedia project. Scalars assigned to recognized trustworthy editors provided the basis for the analysis of the models’ inferential capacity according to evaluation metrics from the domain of computational trust. In particular, argument-based models demonstrated more robustness than those built upon the baselines despite the knowledge bases or datasets employed. This study contributes to the body ofknowledge through the exploitation of defeasible argumentation and its comparison to similar approaches. It adds to previous works, empirically enhancing the generalisability of defeasible argumentation as a compelling approach to reason with quantitative data and uncertain knowledge.
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Open AccessComparing and Extending the Use of Defeasible Argumentation with Quantitative Data in Real-World Contexts
Dealing with uncertain, contradicting, and ambiguous information is still a central issue in Artificial Intelligence (AI). As a result, many formalisms have been proposed or adapted so as to consider non-monotonicity. A non-monotonic formalism is one that allows the retraction of previous conclusions or claims, from premises, in light of new evidence, offering some desirable flexibility when dealing with uncertainty. Among possible options, knowledge-base, non-monotonic reasoning approaches have seen their use being increased in practice. Nonetheless, only a limited number of works and researchers have performed any sort of comparison among them. This research article focuses on evaluating the inferential capacity of defeasible argumentation, a formalism particularly envisioned for modelling non-monotonic reasoning. In addition to this, fuzzy reasoning and expert systems, extended for handling non-monotonicity of reasoning, are selected and employed as baselines, due to their vast and accepted use within the AI community. Computational trust was selected as the domain of application of such models. Trust is an ill-defined construct, hence, reasoning applied to the inference of trust can be seen as non-monotonic. Inference models were designed to assign trust scalars to editors of the Wikipedia project. Scalars assigned to recognized trustworthy editors provided the basis for the analysis of the models’ inferential capacity according to evaluation metrics from the domain of computational trust. In particular, argument-based models demonstrated more robustness than those built upon the baselines despite the knowledge bases or datasets employed. This study contributes to the body ofknowledge through the exploitation of defeasible argumentation and its comparison to similar approaches. It adds to previous works, empirically enhancing the generalisability of defeasible argumentation as a compelling approach to reason with quantitative data and uncertain knowledge.
- Open Access
- 1 June 2020
- Published by Elsevier in Data in Brief
- Vol. 30, 105433
Self-reported data for mental workload modelling in human-computer interaction and third-level education
- 1 June 2020
- Published by Elsevier in Data in Brief
- Vol. 30, 105433
Open AccessSelf-reported data for mental workload modelling in human-computer interaction and third-level education
- Open Access
- 1 June 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 147
An empirical evaluation of the inferential capacity of defeasible argumentation, non-monotonic fuzzy reasoning and expert systems
- 1 June 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 147
Open AccessAn empirical evaluation of the inferential capacity of defeasible argumentation, non-monotonic fuzzy reasoning and expert systems