A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Computing FO-Rewritings in $$\mathcal{EL}$$ in Practice: From Atomic to Conjunctive Queries
[chapter]
2017
Lecture Notes in Computer Science
A prominent approach to implementing ontology-mediated queries (OMQs) is to rewrite into a first-order query, which is then executed using a conventional SQL database system. We consider the case where the ontology is formulated in the description logic EL and the actual query is a conjunctive query and show that rewritings of such OMQs can be efficiently computed in practice, in a sound and complete way. Our approach combines a reduction with a decomposed backwards chaining algorithm for OMQs
doi:10.1007/978-3-319-68288-4_21
fatcat:nrynnalwdbdthnbjbf5i74c4pi