Skip to main content

On the Computability and Complexity Issues of Extended RDF

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 5351)

Abstract

ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. We show that decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a slightly modified semantics for ERDF ontologies, called ERDF #n-stable model semantics. We show that entailment under this semantics is in general decidable and it also extends RDFS entailment. An equivalence statement between the two semantics and various complexity results are provided.

Keywords

  • Extended RDF ontologies
  • Semantic Web
  • negation
  • rules
  • complexity

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-89197-0_5
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   169.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-89197-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   219.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Analyti, A., Antoniou, G., Damásio, C.V., Wagner, G.: Extended RDF as a Semantic Foundation of Rule Markup Languages. Journal of Artificial Intelligence Research (JAIR) 32, 37–94 (2008)

    MathSciNet  MATH  Google Scholar 

  2. Berger, R.: The Undecidability of the Dominoe Problem. Memoirs of the American Mathematical Society 66, 1–72 (1966)

    Google Scholar 

  3. Berners-Lee, T.: Design Issues - Architectual and Philosophical Points. Personal notes (1998), http://www.w3.org/DesignIssues

  4. Berners-Lee, T., Connolly, D., Kagal, L., Scharf, Y., Hendler, J.: N3Logic: A Logical Framework For the World Wide Web. Theory and Practice of Logic Programming (TPLP) 8(3), 249–269 (2008)

    MathSciNet  CrossRef  MATH  Google Scholar 

  5. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys 33(3), 374–425 (2001)

    CrossRef  Google Scholar 

  6. de Bruijn, J., Heymans, S.: RDF and Logic: Reasoning and Extension. In: 6th International Workshop on Web Semantics (WebS 2007), co-located with DEXA 2007, pp. 460–464 (2007)

    Google Scholar 

  7. Gelfond, M., Lifschitz, V.: Logic programs with Classical Negation. In: 7th International Conference on Logic Programming, pp. 579–597 (1990)

    Google Scholar 

  8. Hayes, P.: RDF Semantics. W3C Recommendation, February 10 (2004), http://www.w3.org/TR/2004/REC-rdf-mt-20040210/

  9. Herre, H., Jaspars, J., Wagner, G.: Partial Logics with Two Kinds of Negation as a Foundation of Knowledge-Based Reasoning. In: Gabbay, D.M., Wansing, H. (eds.) What Is Negation?. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  10. Kifer, M., Lausen, G., Wu, J.: Logical Foundations of Object-Oriented and Frame-Based Languages. Journal of the ACM 42(4), 741–843 (1995)

    MathSciNet  CrossRef  MATH  Google Scholar 

  11. ter Horst, H.J.: Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005, vol. 3729, pp. 668–684. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Analyti, A., Antoniou, G., Damásio, C.V., Wagner, G. (2008). On the Computability and Complexity Issues of Extended RDF. In: Ho, TB., Zhou, ZH. (eds) PRICAI 2008: Trends in Artificial Intelligence. PRICAI 2008. Lecture Notes in Computer Science(), vol 5351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89197-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89197-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89196-3

  • Online ISBN: 978-3-540-89197-0

  • eBook Packages: Computer ScienceComputer Science (R0)