Skip to main content
SpringerLink
Log in

Descriptive Types for Linked Data Resources

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8974))

Abstract

This work introduces the notion of descriptive typing. Type systems are typically prescriptive in the sense that they prescribe a space of permitted programs. In contrast, descriptive types assigned to resources in Linked Data provide useful annotations that describe how a resource may be used. Resources are represented by URIs that have no internal structure, hence there is no a priori type for a resource. Instead of raising compile time errors, a descriptive type system raises runtime warnings with a menu of options that make suggestions to the programmer. We introduce a subtype system, algorithmic type system and operational semantics that work together to characterise how descriptive types are used. The type system enables RDF Schema inference and several other modes of inference that are new to Linked Data.

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

Access this chapter

Log in via an institution
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.

    The idea of descriptive types arose in joint work with Giuseppe Castagna and Giorgio Ghelli. Here we instantiate it for our Linked Data scripting language [6]. The development of descriptive types for the full SPARQL 1.1 specification will be given in a forthcoming paper by the above authors.

References

  1. Barbanera, F., Dezani-Ciancaglini, M., de’Liguoro, U.: Intersection and union types: syntax and semantics. Inf. Comput. 119(2), 202–230 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Berners-Lee, T.: Linked data. Int. J. Semant. Web Inf. Syst. 4(2), 1 (2006)

    Google Scholar 

  3. Bizer, C., et al.: DBpedia: a crystallization point for the web of data. Web Semant. Sci. Serv. Agents World Wide Web 7(3), 154–165 (2009)

    Article  Google Scholar 

  4. Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 1247–1250. ACM (2008)

    Google Scholar 

  5. Brickley, D., Guha, R.V.: RDF vocabulary description language 1.0: RDF schema. Edited Recommendation PER-rdf-schema-20140109, W3C (2014)

    Google Scholar 

  6. Ciobanu, G., Horne, R., Sassone, V.: Local type checking for linked data consumers. In: Ravara, A., Silva, J. (eds.) WWV. EPTCS, vol. 123, pp. 19–33 (2013)

    Google Scholar 

  7. Cyganiak, R., Wood, D., Lanthaler, M.: RDF 1.1 concepts and abstract syntax. Recommendation REC-rdf11-concepts-20140225, W3C (2014)

    Google Scholar 

  8. Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM 22(8), 465–476 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dezani-Ciancaglini, M., Horne, R., Sassone, V.: Tracing where and who provenance in linked data: a calculus. Theor. Comput. Sci. 464, 113–129 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  10. Harris, S., Seaborne, A.: SPARQL 1.1 query language. Recommendation REC-sparql11-query-20130321, W3C. MIT, MA (2013)

    Google Scholar 

  11. Hitzler, P., Krötzsch, M., Parsia, B., Patel-Schneider, P.F., Rudolph, S.: OWL 2 Web Ontology Language primer (second edition). Recommendation REC-owl2-primer-20121211, W3C (2012)

    Google Scholar 

  12. Horne, R., Sassone, V.: A verified algebra for read-write linked data. Sci. Comput. Program. 89(A), 2–22 (2014)

    Article  Google Scholar 

  13. MacNeille, H.M.: Extensions of partially ordered sets. Proc. Natl. Acad. Sci. U.S.A. 22(1), 45–50 (1936)

    Article  MATH  Google Scholar 

  14. Muñoz, S., Pérez, J., Gutierrez, C.: Simple and efficient minimal RDFS. Web Semant. Sci. Serv. Agents World Wide Web 7(3), 220–234 (2009)

    Article  Google Scholar 

  15. Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM Trans. Database Syst. (TODS) 34(3), 16 (2009)

    Article  Google Scholar 

  16. Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: Proceedings of 16th WWW Conference, pp. 697–706. ACM (2007)

    Google Scholar 

  17. Tiuryn, J.: Subtype inequalities. In: Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, LICS 1992, pp. 308–315. IEEE (1992)

    Google Scholar 

Download references

Acknowledgements

We are grateful to the organisers of the Ershov memorial conference, PSI 2014, for inviting this work to be presented as a keynote speech. The work of the first and second authors was supported by a grant of the Romanian National Authority for Scientific Research, project number PN-II-ID-PCE-2011-3-0919.

Author information

Authors and Affiliations

  1. Institute of Computer Science, Romanian Academy, Blvd. Carol I, No. 8, Iaşi, Romania

    Gabriel Ciobanu & Ross Horne

  2. Faculty of Information Technology, Kazakh-British Technical University, Almaty, Kazakhstan

    Ross Horne

  3. Electronics and Computer Science, University of Southampton, Southampton, UK

    Vladimiro Sassone

Authors
  1. Gabriel Ciobanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ross Horne
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vladimiro Sassone
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ross Horne .

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Manchester, Manchester, United Kingdom

    Andrei Voronkov

  2. A.P. Ershov Institute of Informatics Systems, Novosibirsk, Russia

    Irina Virbitskaite

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciobanu, G., Horne, R., Sassone, V. (2015). Descriptive Types for Linked Data Resources. In: Voronkov, A., Virbitskaite, I. (eds) Perspectives of System Informatics. PSI 2014. Lecture Notes in Computer Science(), vol 8974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46823-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-46823-4_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-46822-7

  • Online ISBN: 978-3-662-46823-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation