Abstract
We investigate on the possibility of transforming concepts in Description Logics into relational databases and queries in such a way that subsumption between the original concepts can be decided as query answering over a database. For the positive results, we show a translation of ALN -concepts into pairs (database, query) such that, in order to decide Subsumption CD one evaluates the query resulting from the translation of D over the database resulting from C. For the negative results, we show that no compilation is possible for expressive Description Logics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
