M
Maurizio Lenzerini
Researcher at Sapienza University of Rome
Publications - 342
Citations - 23028
Maurizio Lenzerini is an academic researcher from Sapienza University of Rome. The author has contributed to research in topics: Description logic & Ontology (information science). The author has an hindex of 72, co-authored 336 publications receiving 22434 citations. Previous affiliations of Maurizio Lenzerini include University of Rome Tor Vergata & University of Udine.
Papers
More filters
Proceedings ArticleDOI
Data integration: a theoretical perspective
TL;DR: The tutorial is focused on some of the theoretical issues that are relevant for data integration: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.
Journal ArticleDOI
A comparative analysis of methodologies for database schema integration
TL;DR: The aim of the paper is to provide first a unifying framework for the problem of schema integration, then a comparative review of the work done thus far in this area, providing a basis for identifying strengths and weaknesses of individual methodologies, as well as general guidelines for future improvements and extensions.
Journal ArticleDOI
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
TL;DR: It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.
Book ChapterDOI
Linking data to ontologies
Antonella Poggi,Domenico Lembo,Diego Calvanese,Giuseppe De Giacomo,Maurizio Lenzerini,Riccardo Rosati +5 more
TL;DR: This paper presents a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances and a novel mapping language that is able to deal with the so-called impedance mismatch problem.
Proceedings Article
Data complexity of query answering in description logics
TL;DR: In this article, the authors study the data complexity of answering conjunctive queries over Description Logic knowledge bases and show that the Description Logics of the DL-Lite family are the maximal logics that allow query answering over very large ABoxes.