A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes
Journal of Automated Reasoning
Undirected connectivity in log-space
Journal of the ACM (JACM)
Ontologies and Databases: The DL-Lite Approach
Reasoning Web. Semantic Technologies for Information Systems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The DL-lite family and relations
Journal of Artificial Intelligence Research
Qualitative spatial reasoning with topological information
Qualitative spatial reasoning with topological information
Towards scalable instance retrieval over ontologies
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
Constraint Databases
Hi-index | 0.00 |
First order logic (FOL) rewritability is a desirable feature for query answering over geo-thematic ontologies because in most geo-processing scenarios one has to cope with large data volumes. Hence, there is a need for combined geo-thematic logics that provide a sufficiently expressive query language allowing for FOL rewritability. The DL-Lite family of description logics is tailored towards FOL rewritability of query answering for unions of conjunctive queries, hence it is a suitable candidate for the thematic component of a combined geo-thematic logic. We show that a weak coupling of DL-Lite with the expressive region connection calculus RCC8 allows for FOL rewritability under a spatial completeness condition for the ABox. Stronger couplings allowing for FOL rewritability are possible only for spatial calculi as weak as the low-resolution calculus RCC2. Already a strong combination of DL-Lite with the low-resolution calculus RCC3 does not allow for FOL rewritability.