Abstract
We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF is a real extension of RDF and discuss impacts on the complexity of entailment in dRDF. The entailment problem represents the key reasoning task for RDF and is well known to be NP-complete. Remarkably, we show that the restriction of domains in dRDF raises the complexity of entailment from NP- to \({\Pi^P_2}\)-completeness. In order to lower complexity of entailment for both domain-restricted and unrestricted graphs, we take a closer look at the graph structure. For cases where the structure of RDF graphs is restricted via the concept of bounded treewidth, we prove that the entailment is tractable for unrestricted graphs and coNP-complete for domain-restricted graphs.
The work of Axel Polleres has been supported by the European FP6 project inContext (IST-034718) and by Science Foundation Ireland under the Lion project (SFI/02/CE1/I131).
Chapter PDF
Similar content being viewed by others
Keywords
- Resource Description Framework
- Description Logic
- Tree Decomposition
- Resource Description Framework Graph
- Blank Node
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge (2003)
Beckett, D.: Turtle - Terse RDF Triple Language (November 2007), available at http://www.dajobe.org/2004/01/turtle/
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1-2), 1–22 (1993)
Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)
Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theor. Comput. Sci. 239(2), 211–229 (2000)
de Bruijn, J., Eiter, T., Polleres, A., Tompits, H.: On representational issues about combinations of classical theories with nonmonotonic rules. In: Lang, J., Lin, F., Wang, J. (eds.) KSEM 2006. LNCS (LNAI), vol. 4092, Springer, Heidelberg (2006)
de Bruijn, J., Heymans, S.: RDF and logic: Reasoning and extension. In: Proc. WebS 2007, IEEE Computer Society Press, Los Alamitos (2007)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Conolly, D. (ed.): Gleaning Resource Descriptions from Dialects of Languages (GRDDL). W3C recommendation (September 2007)
Hayes, P. (ed.): RDF Semantics. W3C Recommendation (February 2004)
Eiter, T., Ianni, G., Polleres, A., Schindlauer, R., Tompits, H.: Reasoning with rules and ontologies. In: Reasoning Web 2006, Springer, Heidelberg (2006)
Fermüller, C.G., Leitsch, A.: Hyperresolution and automated model building. J. Log. Comput. 6(2), 173–203 (1996)
Grosof, B., Horrocks, I., Volz, R., Decker, S.: Description logic programs: Combining logic programs with description logic. In: Proc. WWW 2003, ACM Press, New York (2003)
Gutiérrez, C., Hurtado, C.A., Mendelzon, A.O.: Foundations of semantic web databases. In: Proc. PODS 2004, ACM Press, New York (2004)
Heymans, S., de Bruijn, J., Predoiu, L., Feier, C., Van Nieuwenborgh, D.: Guarded hybrid knowledge bases. Theory and Practice of Logic Programming (to appear, 2008)
Horrocks, I., Patel-Schneider, P.F.: Reducing OWL entailment to description logic satisfiability. In: Fensel, D., Sycara, K.P., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, Springer, Heidelberg (2003)
Ianni, G., Martello, A., Panetta, C., Terracina, G.: Faithful and effective querying of RDF ontologies using DLVDB. In: Proc. ASP 2007 (2007)
Klyne, G., Carroll, J.J. (eds.): Resource Description Framework (RDF): Concepts and Abstract Syntax. W3C Recommendation (February 2004)
Muñoz, S., Pérez, J., Gutiérrez, C.: Minimal deductive systems for RDF. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 53–67. Springer, Heidelberg (2007)
Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, Springer, Heidelberg (2006)
Pichler, R.: On the complexity of H-subsumption. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, Springer, Heidelberg (1999)
Pichler, R., Polleres, A., Wei, F., Woltran, S.: Entailment for domain-restricted RDF (ext.version). Tech. Report DBAI-TR-2008-59, available at http://www.dbai.tuwien.ac.at/research/report/dbai-tr-2008-59.pdf
Polleres, A., Feier, C., Harth, A.: Rules with contextually scoped negation. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, Springer, Heidelberg (2006)
Prud’hommeaux, E., Seaborne, A. (eds.): SPARQL Query Language for RDF. W3C Proposed Recommendation (November 2007)
Rosati, R.: \(\mathcal{DL}+log\): Tight integration of description logics and disjunctive datalog. In: Proc. KR 2006, AAAI Press, Menlo Park (2006)
Shmueli, O.: Decidability and expressiveness aspects of logic queries. In: Proc. PODS 1987, ACM Press, New York (1987)
ter Horst, H.J.: Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary. JWS 3(2-3), 79–115 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pichler, R., Polleres, A., Wei, F., Woltran, S. (2008). dRDF: Entailment for Domain-Restricted RDF. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds) The Semantic Web: Research and Applications. ESWC 2008. Lecture Notes in Computer Science, vol 5021. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68234-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-68234-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68233-2
Online ISBN: 978-3-540-68234-9
eBook Packages: Computer ScienceComputer Science (R0)