2015/12/09 by Dario De Nart, De Nart, Dario, Dante Degl'Innocenti +3
Computer Science · #Digital Libraries (cs.DL) #FOS: Computer and information sciences #cs.DL
paper · pdf · doi:10.48550/arxiv.1512.02898
in Bulletin of IEEE Technical Committee on Digital Libraries, Volume 12 Issue 1, May 2016
arxiv created 2019/07/11 · arxiv updated 2019/07/12
In this paper we analyse the functional requirements of linked data citation and identify a minimal set of operations and primitives needed to realize such task. Citing linked data implies solving a series of data provenance issues and finding a way to identify data subsets. Those two tasks can be handled defining a simple type system inside data and verifying it with a type checker, which is significantly less complex than interpreting reified RDF statements and can be implemented in a non data invasive way. Finally we suggest that data citation should be handled outside of the data, possibly with an ad-hoc language.