A descriptive type foundation for RDF Schema

Abstract This paper provides a type theoretic foundation for descriptive types that appear in Linked Data. Linked Data is data published on the Web according to principles and standards supported by the W3C. Such Linked Data is inherently messy: this is due to the fact that instead of being assigned a strict a priori schema, the schema is inferred a posteriori. Moreover, such a posteriori schema consists of opaque names that guide programmers, without prescribing structure. We employ what we call a descriptive type system for Linked Data. This descriptive type system differs from a traditional type system in that it provides hints or warnings rather than errors and evolves to describe the data while Linked Data is discovered at runtime. We explain how our descriptive type system allows RDF Schema inference mechanisms to be tightly coupled with domain specific scripting languages for Linked Data, enabling an interactive feedback to Web developers.

[1]  Jorge Pérez,et al.  Simple and Efficient Minimal RDFS , 2009, J. Web Semant..

[2]  Oege de Moor,et al.  Type inference for datalog and its application to query optimisation , 2008, PODS.

[3]  Sylvain Conchon,et al.  JOIN(X): Constraint-Based Type Inference for the Join-Calculus , 2001, ESOP.

[4]  Lunjin Lu,et al.  Type analysis of logic programs in the presence of type definitions , 1995, PEPM '95.

[5]  Deborah L. McGuinness,et al.  PROV-O: The PROV Ontology , 2013 .

[6]  Gerhard Weikum,et al.  WWW 2007 / Track: Semantic Web Session: Ontologies ABSTRACT YAGO: A Core of Semantic Knowledge , 2022 .

[7]  Jens Lehmann,et al.  DBpedia - A crystallization point for the Web of Data , 2009, J. Web Semant..

[8]  John C. Mitchell,et al.  Type inference with simple subtypes , 1991, Journal of Functional Programming.

[9]  Praveen Paritosh,et al.  Freebase: a collaboratively created graph database for structuring human knowledge , 2008, SIGMOD Conference.

[10]  John F. Sowa,et al.  Conceptual Structures: Information Processing in Mind and Machine , 1983 .

[11]  Jovanka Pantovic,et al.  Linked data privacy , 2015, Mathematical Structures in Computer Science.

[12]  Ross Horne,et al.  A verified algebra for read-write Linked Data , 2014, Sci. Comput. Program..

[13]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[14]  Emmanuel Coquery,et al.  Descriptive Typing Rules for Xcerpt , 2005, PPSWR.

[15]  Luca Cardelli,et al.  An Extension of System F with Subtyping , 1991, TACS.

[16]  Benjamin C. Pierce,et al.  Types and programming languages: the next generation , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[17]  Raghu Ramakrishnan,et al.  Efficient Transitive Closure Algorithms , 1988, VLDB.

[18]  Marcelo Arenas,et al.  Semantics and complexity of SPARQL , 2006, TODS.

[19]  Luca Cardelli,et al.  Operations on records , 1989, Mathematical Structures in Computer Science.

[20]  Rod Moten.  Modelling the Semantic Web using a Type System , 2014, SWIM.

[21]  Stathes Hadjiefthymiades,et al.  Semantic Web Services and Mobile Agents Integration for Efficient Mobile Services , 2008, Int. J. Semantic Web Inf. Syst..

[22]  Philip Wadler,et al.  The essence of XML , 2003, POPL '03.

[23]  Peter F. Patel-Schneider,et al.  Analyzing Schema.org , 2014, SEMWEB.

[24]  Limsoon Wong,et al.  Kleisli, a functional query system , 2000, J. Funct. Program..

[25]  Mariangiola Dezani-Ciancaglini,et al.  Intersection and Union Types: Syntax and Semantics , 1995, Inf. Comput..

[26]  Herman J. ter Horst,et al.  Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary , 2005, J. Web Semant..

[27]  Peter F. Patel-Schneider,et al.  OWL 2 Web Ontology Language Primer (Second Edition) , 2012 .

[28]  Giuseppe Castagna,et al.  CDuce: an XML-centric general-purpose language , 2003, ACM SIGPLAN Notices.

[29]  Peter Thiemann,et al.  Recency Types for Analyzing Scripting Languages , 2010, ECOOP.

[30]  Ian Horrocks,et al.  RDFS(FA) and RDF MT: Two Semantics for RDFS , 2003, SEMWEB.

[31]  Christopher G. Chute,et al.  BioPortal: ontologies and integrated data resources at the click of a mouse , 2009, Nucleic Acids Res..

[32]  Limsoon Wong,et al.  Principles of Programming with Complex Objects and Collection Types , 1995, Theor. Comput. Sci..

[33]  Tim Berners-Lee,et al.  Linked data , 2020, Semantic Web for the Working Ontologist.

[34]  Gabriel Ciobanu,et al.  Descriptive Types for Linked Data Resources , 2014, Ershov Memorial Conference.

[35]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[36]  Giuseppe Castagna,et al.  Semantic subtyping , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[37]  Gabriel Ciobanu,et al.  Minimal type inference for Linked Data consumers , 2015, J. Log. Algebraic Methods Program..

[38]  Emden R. Gansner,et al.  Graphviz - Open Source Graph Drawing Tools , 2001, GD.

[39]  Ross Horne,et al.  Tracing where and who provenance in Linked Data: A calculus , 2012, Theor. Comput. Sci..

[40]  Axel Polleres,et al.  On Blank Nodes , 2011, SEMWEB.

[41]  Stefan Decker,et al.  Creating Semantic Web Contents with Protégé-2000 , 2001, IEEE Intell. Syst..

[42]  C. M. Sperberg-McQueen,et al.  W3C XML Schema Definition Language (XSD) 1.1 Part 1: Structures , 2012 .

[43]  Peter Buneman,et al.  Types and persistence in database programming languages , 1987, CSUR.

[44]  Benjamin C. Pierce,et al.  XDuce: A statically typed XML processing language , 2003, TOIT.