Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
- Diego Calvanese, Giuseppe De Giacomo, D. Lembo, M. Lenzerini, R. Rosati
- Computer ScienceJournal of automated reasoning
- 1 October 2007
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.
Data integration: a theoretical perspective
- M. Lenzerini
- Computer ScienceACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 3 June 2002
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.
A comparative analysis of methodologies for database schema integration
- C. Batini, M. Lenzerini, S. Navathe
- Computer ScienceCSUR
- 11 December 1986
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.
Linking Data to Ontologies
- A. Poggi, D. Lembo, Diego Calvanese, Giuseppe De Giacomo, M. Lenzerini, R. Rosati
- Computer ScienceJournal on Data Semantics
- 2008
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.
DL-Lite: Tractable Description Logics for Ontologies
- Diego Calvanese, Giuseppe De Giacomo, D. Lembo, M. Lenzerini, R. Rosati
- Computer ScienceAAAI Conference on Artificial Intelligence
- 9 July 2005
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.
Inconsistency-Tolerant Semantics for Description Logics
- D. Lembo, M. Lenzerini, R. Rosati, M. Ruzzi, Domenico Fabio Savo
- Computer ScienceInternational Conference on Web Reasoning and…
- 22 September 2010
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.
Data Complexity of Query Answering in Description Logics
- Diego Calvanese, Giuseppe De Giacomo, D. Lembo, M. Lenzerini, R. Rosati
- Computer ScienceDescription Logics
- 2 June 2006
AL-log: Integrating Datalog and Description Logics
- F. M. Donini, M. Lenzerini, D. Nardi, Andrea Schaerf
- Computer ScienceJournal of Intelligence and Information Systems
- 1 June 1998
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.
Containment of Conjunctive Regular Path Queries with Inverse
- Diego Calvanese, Giuseppe De Giacomo, M. Lenzerini, Moshe Y. Vardi
- Computer ScienceInternational Conference on Principles of…
- 2000
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.
Automatic Composition of E-services That Export Their Behavior
- D. Berardi, Diego Calvanese, Giuseppe De Giacomo, M. Lenzerini, M. Mecella
- Computer ScienceInternational Conference on Service Oriented…
- 15 December 2003
This work is the first attempt to provide an algorithm for the automatic synthesis of e-Service composition, that is both proved to be correct, and has an associated computational complexity characterization.
...
...