Descriptive types for linked data resources

Ciobanu, Gabriel and Horne, Ross and Sassone, Vladimiro; Voronkov, Andrei and Virbitskaite, Irina, eds. (2015) Descriptive types for linked data resources. In: Perspectives of System Informatics. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) . Springer, SUN, pp. 1-25. ISBN 9783662468234 (https://doi.org/10.1007/978-3-662-46823-4_1)

Full text not available in this repository.Request a copy

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.

CORE (COnnecting REpositories)