• Corpus ID: 6132791

DL-Lite: Tractable Description Logics for Ontologies

@inproceedings{Calvanese2005DLLiteTD,
  title={DL-Lite: Tractable Description Logics for Ontologies},
  author={Diego Calvanese and Giuseppe De Giacomo and Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati},
  booktitle={AAAI Conference on Artificial Intelligence},
  year={2005}
}
We propose a new Description Logic, called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, but also answering complex queries (in particular, conjunctive queries) over the set of instances maintained in secondary storage. We show that in DL-Lite the usual DL reasoning tasks are polynomial in the size of the… 

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.

Query Answering in Expressive Variants of DL-Lite

This paper proposes DL-Litebool, an extension of DL- lite with full Booleans and number restrictions, and study the complexity of reasoning in DL- Litebool and its significant sub-logics, and obtains results by a novel reduction to the one-variable fragment of firstorder logic.

DL-Lite in the Light of First-Order Logic

This paper proposes DL-Litebool, an extension of DL- lite with full Booleans and number restrictions, and study the complexity of reasoning in DL- Litebool and its significant sub-logics, and obtains results by a novel reduction to the one-variable fragment of first-order logic.

Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics

For a whole range of DLs from AL to SHIQ, answering CQs with no transitive roles has CONP-complete data complexity, established by a novel tableaux-based algorithm for checking query entailment.

Temporal Conjunctive Query Answering in the Extended DL-Lite Family

This work investigates temporal conjunctive queries (TCQs) that allow to access temporal data through classical ontologies and studies combined and data complexity of TCQ entailment for ontologies written in description logics from the extended DL-Lite family.

Consistent Query Answering over Description Logic Ontologies

This paper provides inconsistency tolerant semantics for DLs, and studies the computational complexity of consistent query answering over ontologies specified in DL-Lite, a family of DLs specifically tailored to deal with large amounts of data.

Data Complexity of Query Answering in Description Logics

LTCS – Report On Implementing Temporal Query Answering in DL-Lite

This work implemented temporal query answering w.r.t. ontologies formulated in the Description Logic DL-Lite by focusing on temporal conjunctive queries, and shows that implementations of both the iterative and the window-based algorithm answer TCQs within a few milliseconds, and that the former achieves a constant performance, even if data is growing over time.

On the Update of Description Logic Ontologies at the Instance Level

This work provides a general semantics for instance level update in Description Logics, and shows that DL-Lite is closed with respect to instancelevel update, in the sense that the result of an update is always expressible as a new DL- lite ABox.

Data Complexity of Query Answering in Expressive Description Logics via Tableaux

It is established that, for a whole range of sublogics of $\mathcal{SHOIQ}$ that contain $\Mathcal{AL}$, answering such queries has coNP-complete data complexity, and a tight coNP upper bound for positive existential queries without transitive roles is proved.
...

References

SHOWING 1-10 OF 21 REFERENCES

Answering Queries Using Views over Description Logics Knowledge Bases

This paper addresses answering queries using views in a setting where intensional knowledge about the domain is represented using a very expressive Description Logic equipped with n-ary relations, and queries are nonrecursive datalog queries whose predicates are the concepts and relations that appear in the Description Logic knowledge base.

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.

Deduction in Concept Languages: From Subsumption to Instance Checking

This paper addresses the question of whether instance checking can be solved by means of subsumption algorithms by considering several languages where subsumption belongs to diierent complexity classes, and shows that instance checking is not always easily reducible to subsumption.

Combining Horn Rules and Description Logics in CARIN

On the decidability and complexity of query answering over inconsistent and incomplete databases

This paper identifies the maximal class of inclusion dependencies under which query answering is decidable in the presence of key dependencies and establishes decidability and complexity results for query answering under different assumptions on data.

CLASSIC: a structural data model for objects

The kind of language of descriptions and queries presented here provides a new arena for the search for languages that are more expressive than conventional DBMS languages, but for which query processing is still tractable.

The logic of knowledge bases

This book offers a new mathematical model of knowledge that is general and expressive yet more workable in practice than previous models, and presents a style of semantic argument and formal analysis that would be cumbersome or completely impractical with other approaches.

Reasoning with Inclusion Axioms in Description Logics: Algorithms and Complexity

This paper provides a complete characterization of computational complexity of reasoning in these types of schemata, both in the presence and in the absence ofcycles, for a relevant class of description logic.

The complexity of relational query languages (Extended Abstract)

The pattern which will be shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity the authors show completeness in some complexity class.