M. Lenzerini

Publications389
h-index73
Citations23,241
Highly Influential Citations1,530
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Giuseppe De Giacomo
  • 397 Publications • 18,616 Citations
  • Diego Calvanese
  • 503 Publications • 28,749 Citations
  • R. Rosati
  • 227 Publications • 11,358 Citations
  • Moshe Y. Vardi
  • 826 Publications • 40,644 Citations
  • Publications
  • Influence
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
TLDR
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. Expand
Data integration: a theoretical perspective
TLDR
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. Expand
A comparative analysis of methodologies for database schema integration
TLDR
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. Expand
Linking Data to Ontologies
TLDR
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. Expand
DL-Lite: Tractable Description Logics for Ontologies
TLDR
DL-Lite is proposed, a new Description Logic specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning, and shows that in DL-LITE the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynometric in theSize of the ABox, the first result of polynomic data complexity for query answering over DL knowledge bases. Expand
Inconsistency-Tolerant Semantics for Description Logics
TLDR
It is shown that, if the notion of repair studied in databases is used, inconsistency-tolerant query answering is intractable, even for the simplest form of queries. Expand
AL-log: Integrating Datalog and Description Logics
TLDR
A method for query answering in AL-log based on constrained resolution, where the usual deduction procedure defined for Datalog is integrated with a method for reasoning on the structural knowledge. Expand
Data Complexity of Query Answering in Description Logics
TLDR
The Description Logics of the DL-Lite family are the maximal logics allowing conjunctive query answering through standard database technology, and are the first description Logics specifically tailored for effective query answering over very large ABoxes. Expand
Containment of Conjunctive Regular Path Queries with Inverse
TLDR
This paper presents a novel technique to check containment of queries in this class, based on the use of two-way flnite automata, and shows the power of three-way automata in dealing with the inverse operator and with the variables in the queries. Expand
Ontologies and Databases: The DL-Lite Approach
TLDR
This article addresses the problem of accessing relational data sources through an ontology, and presents a solution to the notorious impedance mismatch between the abstract objects in the ontology and the values appearing in data sources. Expand
...
1
2
3
4
5
...