Skip to main content

A Formal Model for RDF Dataset Constraints

  • Conference paper
  • First Online:
Semantic Technology (JIST 2013)

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

Included in the following conference series:

  • 981 Accesses

Abstract

Linked Data has forged new ground in developing easy-to-use, distributed databases. The prevalence of this data has enabled a new genre of social and scientific applications. At the same time, Semantic Web technology has failed to significantly displace SQL or XML in industrial applications, in part because it offers no equivalent schema publication and enforcement mechanisms to ensure data consistency. The RDF community has recognized the need for a formal mechanism to publish verifiable assertions about the structure and content of RDF Graphs, RDF Datasets and related resources. We propose a formal model that could serve as a foundation for describing the various types invariants, pre- and post-conditions for RDF datasets and then demonstrate how the model can be used to analyze selected example constraints.

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 EPUB and 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

Notes

  1. 1.

    RESTful implementations will want to minimize preconditions that prevent the operation from being idempotent. An \(add\) operation that states the triples cannot be present or a \(remove\) operation that states that the triples must exist would have to be implemented as an http POST operation rather than a PUT.

  2. 2.

    While this information is undoubtedly available in the Protégé documentation, the current description is derived from the authors’ experience with the editor itself and, as such, may be incomplete or inaccurate. We see this as another example where a formal specification for graph invariants would prove useful.

References

  1. Joint Technical Committee ISO/IEC JTC 1. Information Technology - Z formal specification notation - Syntax, type system, and semantics (2002)

    Google Scholar 

  2. Carothers, G., Seaborne, A.: TriG: Rdf dataset language. World Wide Web Consortium, Last Call Working Draft 19 September 2013

    Google Scholar 

  3. Cyganiak, R., Wood, D.: RDF 1.1 concepts and abstract syntax. World Wide Web Consortium, Working Draft WD-rdf11-concepts-20130723, August 2013

    Google Scholar 

  4. Cyganiak, R., Wood, D.: RDF 1.1 concepts and abstract syntax - generalized rdf triples, graphs, and datasets. World Wide Web Consortium, Working Draft WD-rdf11-concepts-20130723, August 2013

    Google Scholar 

  5. Johnson, D., Speicher, S.: OSLC open services for lifecycle collaboration core specification version 2.0. OSLC Specification (web page), May 2013

    Google Scholar 

  6. Isaac, A., Summers, E.: SKOS simple knowledge organization system primer. World Wide Web Consortium, Note NOTE-skos-primer-20090818, August 2009

    Google Scholar 

  7. David, A.: Schmidt. Denotational semantics - A methodology for language development, On line image (1997)

    Google Scholar 

  8. Spivey, J.M.: The Fuzz Manual. Computing Science Consultancy, Oxford (1988)

    Google Scholar 

  9. W3C OWL Working Group. OWL 2 web ontology language – document overview (second edition). World Wide Web Consortium, Recommendation REC-owl2-overview-20121211, December 2012

    Google Scholar 

  10. W3C SPARQL Working Group. SPARQL 1.1 overview. World Wide Web Consortium, Recommendation REC-sparql11-overview-20130321, March 2013

    Google Scholar 

  11. Woodcock, J., Davies, J.: Using Z. Specification, Refinement, and Proof. Prentice-Hall, Upper Saddle River (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Harold Solbrig .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Solbrig, H., Prud’hommeaux, E., Chute, C.G., Davies, J. (2014). A Formal Model for RDF Dataset Constraints. In: Kim, W., Ding, Y., Kim, HG. (eds) Semantic Technology. JIST 2013. Lecture Notes in Computer Science(), vol 8388. Springer, Cham. https://doi.org/10.1007/978-3-319-06826-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06826-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06825-1

  • Online ISBN: 978-3-319-06826-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics