We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
Boris Konev, Roman Kontchakov, Michel Ludwig, Thom...
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
This paper gives an account of how traditional metadata application profiles are related to Web ontologies and Description Logics. It is shown that metadata profiles can be formal...
Dimitrios A. Koutsomitropoulos, Georgia D. Solomou
Ontologies are entities that evolve over time, therefore it is essential to represent and manage changes to ontologies along with the ontologies themselves. In this paper we propos...