Skip to main content

A Formal Theory for Modular ERDF Ontologies

  • Conference paper
Web Reasoning and Rule Systems (RR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5837))

Included in the following conference series:

Abstract

The success of the Semantic Web is impossible without any form of modularity, encapsulation, and access control. In an earlier paper, we extended RDF graphs with weak and strong negation, as well as derivation rules. The ERDF #n-stable model semantics of the extended RDF framework (ERDF) is defined, extending RDF(S) semantics. In this paper, we propose a framework for modular ERDF ontologies, called modular ERDF framework, which enables collaborative reasoning over a set of ERDF ontologies, while support for hidden knowledge is also provided. In particular, the modular ERDF stable model semantics of modular ERDF ontologies is defined, extending the ERDF #n-stable model semantics. Our proposed framework supports local semantics and different points of view, local closed-world and open-world assumptions, and scoped negation-as-failure. Several complexity results are provided.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

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)

    MATH  Google Scholar 

  2. Analyti, A., Antoniou, G., Damásio, C.V., Wagner, G.: On the Computability and Complexity Issues of Extended RDF. In: Ho, T.-B., Zhou, Z.-H. (eds.) PRICAI 2008. LNCS (LNAI), vol. 5351, pp. 5–16. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  4. Gelder, A.V., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

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

    Google Scholar 

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

  7. 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 

  8. Klyne, G., Carroll, J.J.: Resource Description Framework (RDF): Concepts and Abstract Syntax. W3C Recommendation, February 10 (2004), http://www.w3.org/TR/2004/REC-rdf-concepts-20040210/

  9. Lloyd, J.W., Topor, R.W.: Making Prolog more Expressive. Journal of Logic Programming 1(3), 225–240 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  10. Oikarinen, E., Janhunen, T.: Achieving compositionality of the stable model semantics for smodels programs. TPLP 8(5–6), 717–761 (2008)

    MATH  MathSciNet  Google Scholar 

  11. Polleres, A., Feier, C., Harth, A.: Rules with Contextually Scoped Negation. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 332–347. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Sintek, M., Decker, S.: TRIPLE - A Query, Inference, and Transformation Language for the Semantic Web. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 364–378. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Stefan Decker, W.N., Sintek, M.: The Model-Theoretic Semantics of TRIPLE. Technical Report (2002)

    Google Scholar 

  14. Wagner, G., Giurca, A., Diaconescu, I.-M., Antoniou, G., Analyti, A., Damasio, C.: Reasoning on the Web with Open and Closed Predicates. In: 3rd International Workshop on Applications of Logic Programming to the (Semantic) Web and Web Services (ALPSWS 2008), in conjunction with ICLP 2008, pp. 71–84 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Analyti, A., Antoniou, G., Damásio, C.V. (2009). A Formal Theory for Modular ERDF Ontologies. In: Polleres, A., Swift, T. (eds) Web Reasoning and Rule Systems. RR 2009. Lecture Notes in Computer Science, vol 5837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05082-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05082-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05081-7

  • Online ISBN: 978-3-642-05082-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics