%0 Conference Paper %1 Bruijn/2007/Logical %A Bruijn, Jos De %A Heymans, Stijn %B Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea %C Berlin, Heidelberg %D 2007 %E Aberer, Karl %E Choi, Key-Sun %E Noy, Natasha %E Allemang, Dean %E Lee, Kyung-Il %E Nixon, Lyndon J B %E Golbeck, Jennifer %E Mika, Peter %E Maynard, Diana %E Schreiber, Guus %E Cudré-Mauroux, Philippe %I Springer Verlag %K 2007 complexity database formal_language foundation iswc logical reasoning research_14 semantic_web %P 85--98 %T Logical Foundations of (e)RDF(S): Complexity and Reasoning %U http://iswc2007.semanticweb.org/papers/85.pdf %V 4825 %X 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.

@inproceedings{Bruijn/2007/Logical, 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.}, added-at = {2007-11-07T19:13:58.000+0100}, address = {Berlin, Heidelberg}, author = {Bruijn, Jos De and Heymans, Stijn}, biburl = {https://www.bibsonomy.org/bibtex/2b173da7b15862e5f9b6dde718c406cda/iswc2007}, booktitle = {Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea}, crossref = {http://data.semanticweb.org/conference/iswc-aswc/2007/proceedings}, editor = {Aberer, Karl and Choi, Key-Sun and Noy, Natasha and Allemang, Dean and Lee, Kyung-Il and Nixon, Lyndon J B and Golbeck, Jennifer and Mika, Peter and Maynard, Diana and Schreiber, Guus and Cudré-Mauroux, Philippe}, interhash = {950471317c1c64591539367963284eb1}, intrahash = {b173da7b15862e5f9b6dde718c406cda}, keywords = {2007 complexity database formal_language foundation iswc logical reasoning research_14 semantic_web}, month = {November}, pages = {85--98}, publisher = {Springer Verlag}, series = {LNCS}, timestamp = {2007-11-07T19:20:51.000+0100}, title = {Logical Foundations of (e)RDF(S): Complexity and Reasoning}, url = {http://iswc2007.semanticweb.org/papers/85.pdf}, volume = 4825, year = 2007 }