Invited Talks
From Whispers to Structures: Computational Argumentation in Politics
Serena Villata
Argument(ation) Mining (AM) is the dimension of computational argumentation aiming at automatically processing natural language arguments and reason upon them. More precisely, argument mining aims at extracting, classifying and analysing natural language arguments and their relations from text, with the final goal of providing machine-processable structured data for computational models of argument. In this keynote talk, I will first introduce this research area, highlight-ing the main successful tasks and open issues in identifying argumentative structures from different kinds of texts (e.g., clinical trials, online user generated content, news articles). Then, I will present a key challenge which conjugate argument mining with formal computational models of argumentation, i.e., the assessment of the trustworthiness of natural language arguments, with a focus on fallacious argumentation, with the aim to show how these methods can be used to automatically identify fallacious arguments in political debates. I will conclude with some thoughts on the challenge of automatic generation of counter-arguments to fight online disinformation and hate speech.
Serena Villata is Research Director at CNRS. She is a research fellow of the Institut 3IA Côte d'Azur since 2019 and the Scientific Director of the institute since 2025. She is the head of the MARIANNE research team at Inria. In November 2021, she has been awarded with the Prix "Jeunes chercheurs et jeunes chercheuses" from Inria – Académie des Sciences. She received in 2010 the Ph.D. degree from the University of Turin (Italy) for her work on computational argumentation in Artificial Intelligence. Her research area is Artificial Intelligence (AI), and her current work focuses on computational argumentation, with a specific focus on legal and medical texts, political debates and social network harmful content (abusive language, disinformation). Her work conjugates argument-based reasoning frameworks with natural language arguments extracted from text.
Can Requirements Make Machine Learning Safer? From constrained prediction to structured generation
Eleonora Giunchiglia
Abstract: As machine learning systems move from narrow prediction tasks to generative and decision-making settings, their ability to satisfy domain requirements is becoming increasingly important. Yet deep neural networks can still produce outputs that violate even simple logical, structural, or regulatory constraints. This talk argues that requirements should be treated as first-class citizens in machine learning: not only as criteria for evaluating a model after deployment, but as objects that can shape what models learn, generate, and optimize for from the outset. I will show how logical requirements can define safe output spaces and be compiled into neural architectures, enabling predictions and generations that are compliant by design. Through examples in autonomous driving, tabular data generation, and neurosymbolic reasoning, the talk will illustrate how requirements can make learning systems safer, more data-efficient, and better aligned with the structure of the problems they are meant to solve.
Eleonora Giunchiglia is an Assistant Professor in the Department of Electrical and Electronic Engineering at Imperial College London and the Principal Investigator of the DUCK Lab, which focuses on Data, Uncertainty, Constraints and Knowledge. She completed her DPhil at the University of Oxford in 2022 and subsequently held a postdoctoral position at TU Wien before joining Imperial in 2024. Her research lies at the intersection of machine learning and formal reasoning, with a focus on neurosymbolic AI. In particular, she develops methods that integrate logical constraints, background knowledge, and formal requirements into neural models, with the goal of making AI systems safer, more reliable, and more trustworthy.
Tutorial
Efficient Evaluation of Logic Programs
Giuseppe Mazzotta, Francesco Ricca
Answer Set Programming (ASP) combines an expressive declarative language with efficient solving technology, making it suitable for modeling complex combinatorial problems. State-of-the-art ASP systems based on Ground&Solve approach suffer from the grounding bottleneck, which can limit applicability. Recently, different alternative evaluation techniques have been introduced, including compilation-based ASP solving, which has emerged as a promising approach to overcome the grounding bottleneck. In this tutorial we provide an overview of compilation-based techniques by showing how logical rules can be compiled into customized propagators and present the proasp system, the first compilation-based ASP solver which integrate grounding and compilation within a unified framework.
Giuseppe Mazzotta is a Researcher in Computer Science at the Department of Mathematics, University of Calabria, Italy. He obtained his MSc Degree in Computer Science in 2020 and completed his PhD in Computer Science and Mathematics in 2023 at the same institution. Giuseppe research focuses on knowledge representation and reasoning, particularly in Answer Set Programming (ASP). During his PhD, he specialized in developing efficient techniques for evaluating ASP programs affected by the grounding bottleneck problem. His work has been published in international conferences, earning him recognition such as the ”AAAI Outstanding Student Paper Honorable Mention” at the 36th AAAI Conference on Artificial Intelligence. He has been the Organizing Chair of ICLP 2025. A list of his publications can be found at https://dblp.org/pid/277/2609.
Francesco Ricca (www.mat.unical.it/ricca) is Full Professor of Computer Science at the Department of Mathematics of the University of Calabria, Italy. He received his Laurea Degree in Computer Science Engineering (2002) and a PhD in Computer Science and Mathematics (2006) from the University of Calabria, Italy. Francesco Ricca research interests belong tothe AI area of knowledge representation and reasoning. His particular research focus lies on Answer Set Programming. He is member of the Executive Board of the Association for Logic Programming, member of the steering committee of the Rule and Reasoning Association (RRA), and member of the Steering Committee of the Italian Association for Computational Logic (GULP). He was program (co-)chair of ICLP20, RuleML+RR18 and is general chair of ICLP25 He was a lecturer in many editions (2023-2024-2025) of the ESSAI Summer school. Francesco Ricca is co-author of more than 150 refereed research articles published in international journals (40+), collections, and conference proceedings. A list of Francesco Ricca’s scientific publications can be found at https://dblp.org/pid/r/FrancescoRicca.