Description Logic Query Answering with Relational Databases
Norbert Kottmann · 2006
A knowledge base system O using description logics should be able to find an answer to the retrieval problem in reasonable time, returning a sound and complete result. That means finding all individuals a of a concept C where O entails that a belongs to C. We present a description logic based solution for a knowledge base where the information and its consequences, computed by a completion algorithm, are stored in a relational database. Our system issues simple database lookups to answer description logic queries. We are able to show that these queries can be answered in constant amount of time even for large data sets and complex concepts.