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

Presented at: 6th International and 2nd Asian Semantic Web Conference (ISWC2007+ASWC2007)

by Jos De Bruijn, Stijn Heymans

Webpage: http://data.semanticweb.org/pdfs/iswc-aswc/2007/ISWC2007_RT_deBruijn.pdf

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.

Logical Foundations of (e)RDF(S): Complexity and Reasoning was presented at this event.

Keywords: Database, Formal language, Reasoning, Semantic Web


Resource URI on the dog food server: http://data.semanticweb.org/conference/iswc-aswc/2007/tracks/research/papers/85
Same as: http://revyu.com/things/iswc-aswc-2007-research-paper-85-logical-foundations


Explore this resource elsewhere: