activity
20192023
most citedOn Freese's technique

1 citations · 3 across the 6 of their papers we have counts for

collaborators

10 papers

cs.LG2023★ 1 cited

Interpretable Graph Networks Formulate Universal Algebra Conjectures

Francesco Giannini, Stefano Fioravanti, Oguzhan Keskin +4

The rise of Artificial Intelligence (AI) recently empowered researchers to investigate hard mathematical problems which eluded traditional approaches for decades. Yet, the use of A…

cs.AI2023★ 1 cited

Categorical Foundations of Explainable AI: A Unifying Theory

Pietro Barbiero, Stefano Fioravanti, Francesco Giannini +3

Explainable AI (XAI) aims to address the human need for safe and reliable AI systems. However, numerous surveys emphasize the absence of a sound mathematical formalization of key X…

cs.AI2023

Enhancing Embedding Representations of Biomedical Data using Logic Knowledge

Michelangelo Diligenti, Francesco Giannini, Stefano Fioravanti +3

Knowledge Graph Embeddings (KGE) have become a quite popular class of models specifically devised to deal with ontologies and graph structure data, as they can implicitly encode st…

math.RA2023★ 1 cited

On Freese's technique

Paolo Aglianò, Stefano Bartali, Stefano Fioravanti

In this paper we explore some applications of a certain technique (that we call the Freese's technique), which is a tool for identifying certain lattices as sublattices of the cong…

math.RA2023

On properties described by terms in commutator relation

Stefano Fioravanti

We investigate properties of varieties of algebras described by a novel concept of equation that we call \emph{commutator equation}. A commutator equation is a relaxation of the st…

math.RA2020

Expansions of abelian squarefree groups

Stefano Fioravanti

We investigate finitary functions from to for a squarefree number . We show that the lattice of all clones on the squarefree set $\mathbb{Z}_{p…