Skip to search formSkip to main contentSkip to account menu

Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

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.
View on Springer (opens in a new tab)

Data integration: a theoretical perspective

  • M. Lenzerini
  • Computer Science
    ACM 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.
View on ACM (opens in a new tab)

A comparative analysis of methodologies for database schema integration

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.
View on ACM (opens in a new tab)

Linking Data to Ontologies

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.
View via Publisher (opens in a new tab)

DL-Lite: Tractable Description Logics for Ontologies

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.
View Paper (opens in a new tab)

Inconsistency-Tolerant Semantics for Description Logics

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.
View via Publisher (opens in a new tab)

Data Complexity of Query Answering in Description Logics

View via Publisher (opens in a new tab)

AL-log: Integrating Datalog and Description Logics

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.
View on Springer (opens in a new tab)

Containment of Conjunctive Regular Path Queries with Inverse

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

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.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)