dRDF: Entailment for Domain-Restricted RDF

  • Reinhard Pichler
  • Axel Polleres
  • Fang Wei
  • Stefan Woltran
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5021)

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.

References

  1. 1.
    Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge (2003)Google Scholar
  2. 2.
    Beckett, D.: Turtle - Terse RDF Triple Language (November 2007), available at http://www.dajobe.org/2004/01/turtle/
  3. 3.
    Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1-2), 1–22 (1993)MathSciNetMATHGoogle Scholar
  4. 4.
    Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)CrossRefMathSciNetMATHGoogle Scholar
  5. 5.
    Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theor. Comput. Sci. 239(2), 211–229 (2000)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    de Bruijn, J., Heymans, S.: RDF and logic: Reasoning and extension. In: Proc. WebS 2007, IEEE Computer Society Press, Los Alamitos (2007)Google Scholar
  8. 8.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
  9. 9.
    Conolly, D. (ed.): Gleaning Resource Descriptions from Dialects of Languages (GRDDL). W3C recommendation (September 2007)Google Scholar
  10. 10.
    Hayes, P. (ed.): RDF Semantics. W3C Recommendation (February 2004)Google Scholar
  11. 11.
    Eiter, T., Ianni, G., Polleres, A., Schindlauer, R., Tompits, H.: Reasoning with rules and ontologies. In: Reasoning Web 2006, Springer, Heidelberg (2006)Google Scholar
  12. 12.
    Fermüller, C.G., Leitsch, A.: Hyperresolution and automated model building. J. Log. Comput. 6(2), 173–203 (1996)CrossRefMATHGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Gutiérrez, C., Hurtado, C.A., Mendelzon, A.O.: Foundations of semantic web databases. In: Proc. PODS 2004, ACM Press, New York (2004)Google Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    Ianni, G., Martello, A., Panetta, C., Terracina, G.: Faithful and effective querying of RDF ontologies using DLVDB. In: Proc. ASP 2007 (2007)Google Scholar
  18. 18.
    Klyne, G., Carroll, J.J. (eds.): Resource Description Framework (RDF): Concepts and Abstract Syntax. W3C Recommendation (February 2004)Google Scholar
  19. 19.
    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)CrossRefGoogle Scholar
  20. 20.
    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)CrossRefGoogle Scholar
  21. 21.
    Pichler, R.: On the complexity of H-subsumption. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, Springer, Heidelberg (1999)CrossRefGoogle Scholar
  22. 22.
    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
  23. 23.
    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)CrossRefGoogle Scholar
  24. 24.
    Prud’hommeaux, E., Seaborne, A. (eds.): SPARQL Query Language for RDF. W3C Proposed Recommendation (November 2007)Google Scholar
  25. 25.
    Rosati, R.: \(\mathcal{DL}+log\): Tight integration of description logics and disjunctive datalog. In: Proc. KR 2006, AAAI Press, Menlo Park (2006)Google Scholar
  26. 26.
    Shmueli, O.: Decidability and expressiveness aspects of logic queries. In: Proc. PODS 1987, ACM Press, New York (1987)Google Scholar
  27. 27.
    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)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Reinhard Pichler
    • 1
  • Axel Polleres
    • 2
  • Fang Wei
    • 1
  • Stefan Woltran
    • 1
  1. 1.Institut für InformationssystemeTechnische Universität WienAustria
  2. 2.Digital Enterprise Research Institute (DERI)National University of IrelandGalway

Personalised recommendations