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

A paper written by Stijn Heymans and Jos De Bruijn. It was presented at the ISWC2007+ASWC2007.

[edit] 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.

A linked list of all papers is provided in the article on ISWC2007+ASWC2007 papers. This article has originally been created from the ISWC 2007/ASWC 2007 metadata.