Storing and Querying Ontologies in Logic Databases

The intersection of Description Logic inspired ontology languages with Logic Programs has been recently analyzed in [GHVD03]. The resulting language, called Description Logic Programs, covers RDF Schema and a notable portion of OWL Lite. However, the proposed mapping in [GHVD03] from the corresponding OWL fragment into Logic Programs has shown scalability as well as representational de�cits within
our experiments and analysis. In this paper we propose an alternative mapping resulting in lower computational complexity and more representational exibility. We also present benchmarking results for both mappings with ontologies of di�erent size and complexity.