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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
De Bruijn, J., & Heymans, S. (2007). Logical foundations of (e)RDF(S): Complexity and reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4825 LNCS, pp. 86–99). https://doi.org/10.1007/978-3-540-76298-0_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
