Luigi Bellomarini

Luigi Bellomarini

Auto-generated profile, based on publicly available information

Luigi Bellomarini

Banca d’Italia

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2019 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
PDF file
PAPaolo Atzeni
Paolo Atzeni
LBLuigi Bellomarini
Luigi Bellomarini
PPPaolo Papotti
Paolo Papotti
RTRiccardo Torlone
Riccardo Torlone
The definition of mappings between heterogeneous schemas is a critical activity of any database application. Existing tools provide high level interfaces for the discovery of correspondences between elements of schemas, but schema mappings need to be manually specified every time from scratch, even if the scenario at hand is similar to one that has already been addressed. The problem is that schema mappings are precisely defined over a pair of schemas and cannot directly be reused on different scenarios. We tackle this challenge by generalizing schema mappings as meta-mappings: formalisms that describe transformations between generic data structures called meta-schemas. We formally characterize schema mapping reuse and explain how meta-mappings are able to: (i) capture enterprise knowledge from previously defined schema mappings and (ii) use this knowledge to suggest new mappings. We develop techniques to infer meta-mappings from existing mappings, to organize them into a searchable repository, and to leverage the repository to propose to users mappings suitable for their needs. We study effectiveness and efficiency in an extensive evaluation over real-world scenarios and show that our system can infer, store, and search millions of meta-mappings in seconds.

6 October 2025 in Artificial Intelligence and Law
Verified
Journal Article
Open access
PDF file
ACAndrea Colombo
Andrea Colombo
Anna BernasconiAnna Bernasconi
Anna Bernasconi
LBLuigi Bellomarini
Luigi Bellomarini
LGLuigi Guiso
Luigi Guiso
CMClaudio Michelacci
Claudio Michelacci
SCStefano Ceri
Stefano Ceri
Navigating and retrieving relevant excerpts of legislation is challenging, requiring time and effort, especially to fine-tune appropriate input search queries. Furthermore, the continuously growing, heterogeneous body of laws, combined with a deep interconnection among normative acts, adds a layer of complexity: some potentially relevant rules may be hidden in articles that, through multiple citations and references, might be relevant for the input query. Traditional search systems, based on keywords or more sophisticated approaches as BM25 or TF-IDF, do not support such flexible exploration, being ineffective at handling contextual information. To address these challenges, recent research proposed using graph data models for legislative knowledge management, introducing a straightforward approach to handling network complexity. They adopted the Property Graph data structure, demonstrating how it provides semantics and navigation power, supporting advanced querying tools for legislative acts, and implemented it on the Italian legislation. In this paper, we build on recent results on legislative knowledge management with graphs by proposing LegisSearch, an effective navigation system that, combining the graph data model with pre-trained Large Language Models and universal text embeddings, allows users to conduct powerful searches within a legislative system. We implement LegisSearch within the Italian graph of national laws, and we test its performance across multiple domains by comparing its search results with those provided in specific thematic areas by Italian ministries on their official websites, demonstrating its superior retrieval performance over traditional search systems and testing the contribution of each component.

1 September 2022 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
LBLuigi Bellomarini
Luigi Bellomarini
DBDavide Benedetto
Davide Benedetto
MBMatteo Brandetti
Matteo Brandetti
ESEmanuel Sallinger
Emanuel Sallinger
Equality-generating dependencies (EGDs) allow to fully exploit the power of existential quantification in ontological reasoning settings modeled via Tuple-Generating Dependencies (TGDs), by enabling value-assignment or forcing the equivalence of fresh symbols. These capabilities are at the core of many common reasoning tasks, including graph traversals, clustering, data matching and data fusion, and many more related real-world scenarios.However, the interplay of TGDs and EGDs is known to lead to undecidability or intractability of query answering in tractable Datalog+/- fragments, like Warded Datalog+/-, for which, in the sole presence of TGDs, query answering is PTIME in data complexity. Restrictions of equality constraints, like separable EGDs, have been studied, but all achieve decidability at the cost of limited expressive power, which makes them unsuitable for the mentioned tasks.This paper introduces the class of "harmless" EGDs, that subsume separable EGDs and allow to model a very broad class of tasks. We contribute a sufficient syntactic condition for testing harmlessness, an undecidable task in general. We argue that in Warded Datalog+/- with harmless EGDs, ontological reasoning is decidable and PTIME. From such theoretical underpinnings, we develop novel chase-based techniques for reasoning with harmless EGDs and present an implementation within the Vadalog system, a state-of-the-art Datalog-based reasoner. We provide full-scale experimental evaluation and comparative analysis.

9 June 2024
Verified
Conference Paper
Open access
SCStefano Ceri
Stefano Ceri
Anna BernasconiAnna Bernasconi
Anna Bernasconi
AGAlessia Gagliardi
Alessia Gagliardi
DMDavide Martinenghi
Davide Martinenghi
LBLuigi Bellomarini
Luigi Bellomarini
DMDavide Magnanimi
Davide Magnanimi
Graph databases are emerging as the leading data management technology for storing large knowledge graphs; significant efforts are ongoing to produce new standards (such as the Graph Query Language, GQL), as well as enrich them with properties, types, schemas, and keys. In this article, we introduce PG-Triggers, a complete proposal for adding triggers to Property Graphs, along the direction marked by the SQL3 Standard. We define the syntax and semantics of PG-Triggers and then illustrate how they can be implemented on top of Neo4j, one of the most popular graph databases. In particular, we introduce a syntax-directed translation from PG-Triggers into Neo4j, which makes use of the so-called APOC triggers; APOC is a community-contributed library for augmenting the Cypher query language supported by Neo4j. We also cover Memgraph, and show that our approach applies to this system in a similar way. We illustrate the use of PG-Triggers through a life science application inspired by the COVID-19 pandemic. The main objective of this article is to introduce an active database standard for graph databases as a first-class citizen at a time when reactive graph management is in its infancy, so as to minimize the conversion efforts towards a full-fledged standard proposal.

9 November 2022 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
LBLuigi Bellomarini
Luigi Bellomarini
ELEleonora Laurenza
Eleonora Laurenza
ESEmanuel Sallinger
Emanuel Sallinger
ESEvgeny Sherkhonov
Evgeny Sherkhonov
We provide a framework for probabilistic reasoning in Vadalog-based Knowledge Graphs (KGs), satisfying the requirements of ontological reasoning: full recursion, powerful existential quantification, expression of inductive definitions. Vadalog is a Knowledge Representation and Reasoning (KRR) language based on Warded Datalog+/–, a logical core language of existential rules, with a good balance between computational complexity and expressive power. Handling uncertainty is essential for reasoning with KGs. Yet Vadalog and Warded Datalog+/– are not covered by the existing probabilistic logic programming and statistical relational learning approaches for several reasons, including insufficient support for recursion with existential quantification and the impossibility to express inductive definitions. In this work, we introduce Soft Vadalog, a probabilistic extension to Vadalog, satisfying these desiderata. A Soft Vadalog program induces what we call a Probabilistic Knowledge Graph (PKG), which consists of a probability distribution on a network of chase instances, structures obtained by grounding the rules over a database using the chase procedure. We exploit PKGs for probabilistic marginal inference. We discuss the theory and present MCMC-chase, a Monte Carlo method to use Soft Vadalog in practice. We apply our framework to solve data management and industrial problems and experimentally evaluate it in the Vadalog system.

1 August 2023 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
LBLuigi Bellomarini
Luigi Bellomarini
MBMarco Benedetti
Marco Benedetti
AGAndrea Gentili
Andrea Gentili
DMDavide Magnanimi
Davide Magnanimi
ESEmanuel Sallinger
Emanuel Sallinger
Logic-based Knowledge Graphs (KGs) are gaining momentum in academia and industry thanks to the rise of expressive and efficient languages for Knowledge Representation and Reasoning (KRR). These languages accurately express business rules, through which valuable new knowledge is derived. A versatile and scalable backend reasoner, like Vadalog, a state-of-the-art system for logic-based KGs---based on an extension of Datalog---executes the reasoning. In this demo, we present KG-Roar, a web-based interactive development and navigation environment for logical KGs. The system lets the user augment an input graph database with intensional definitions of new nodes and edges and turn it into a KG, via the metaphor of reasoning widgets---user-defined or off-the-shelf code snippets that capture business definitions in the Vadalog language. Then, the user can seamlessly browse the original and the derived nodes and edges within a "Virtual Knowledge Graph", which is reasoned upon and generated interactively at runtime, thanks to the scalability and responsiveness of Vadalog. KG-Roar is domain-independent but domain aware, as exploration controls are contextually generated based on the intensional definitions. We walk the audience through KG-Roar showcasing the construction of certain business definitions and putting it into action on a real-world financial KG, from our work with the Bank of Italy.