Authors

* External authors

Venue

Date

Share

Transparent Explainable Logic Layers

Alessio Ragno*

Marc Plantevit

Celine Robardet

Roberto Capobianco

* External authors

ECAI-24

2025

Abstract

Explainable AI seeks to unveil the intricacies of black box models through post-hoc strategies or self-interpretable models. In this paper, we tackle the problem of building layers that are intrinsically explainable through logical rules. In particular, we address current state-of-the-art methods' lack of fidelity and expressivity by introducing a transparent explainable logic layer (TELL). We propose to constrain a feed-forward layer with positive weights, which, combined with particular activation functions, offer the possibility of a direct translation into logic rules. Additionally, this approach overcomes the limitations of previous models, linked to their applicability to binary data only, by proposing a new way to automatically threshold real values and incorporate the obtained predicates into logical rules. We show that, compared to state-of-the-art, TELL achieves similar classification performances and, at the same time, provides higher explanatory power, measured by the agreement between models’ outputs and the activation of the logical explanations. In addition, TELL offers a broader spectrum of applications thanks to the possibility of its use on real data.

Related Publications

Identifying Candidates for Protein-Protein Interaction: A Focus on NKp46’s Ligands

EXPLIMED, 2025
Alessia Borghini, Federico Di Valerio, Alessio Ragno*, Roberto Capobianco

Recent advances in protein-protein interaction (PPI) research have harnessed the power of artificialintelligence (AI) to enhance our understanding of protein behaviour. These approaches have becomeindispensable tools in the field of biology and medicine, enabling scientists …

Neural Reward Machines

ECAI, 2025
Elena Umili*, Francesco Argenziano*, Roberto Capobianco

Non-markovian Reinforcement Learning (RL) tasks arevery hard to solve, because agents must consider the entire history ofstate-action pairs to act rationally in the environment. Most works usesymbolic formalisms (as Linear Temporal Logic or automata) to specify the temporall…

DeepDFA: Automata Learning through Neural Probabilistic Relaxations

ECAI, 2025
Elena Umili*, Roberto Capobianco

In this work, we introduce DeepDFA, a novel approach to identifying Deterministic Finite Automata (DFAs) from traces, harnessing a differentiable yet discrete model. Inspired by both the probabilistic relaxation of DFAs and Recurrent Neural Networks (RNNs), our model offers …

JOIN US

Shape the Future of AI with Sony AI

We want to hear from those of you who have a strong desire
to shape the future of AI.