Logical Foundations of (e)RDF(S): Complexity and Reasoning

Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms such as logic programming and description logics. In this paper we address this issue by considering embeddings of RDF and RDFS in logic. Using these embeddings, combined with existing results about various fragments of logic, we establish several novel complexity results. The embeddings we consider show how techniques from deductive databases and description logics can be used for reasoning with RDF(S). Finally, we consider querying RDF graphs and establish the data complexity of conjunctive querying for the various RDF entailment regimes.

• Type: Conference
• Year: 2007
• Where: SEMWEB
• Authors: Jos de Bruijn, Stijn Heymans
• Keywords: Description Logics, Knowledge Representation Formalisms, SEMWEB 2007, Various Rdf Entailment