Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | DocType |
|---|---|---|
2016 | TCDL Bulletin | Journal |
Volume | Issue | Citations |
abs/1512.02898 | 1 | 0 |
PageRank | References | Authors |
0.34 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dario De Nart | 1 | 34 | 7.70 |
| Dante Degl'Innocenti | 2 | 13 | 4.45 |
| Marco Peressotti | 3 | 32 | 8.48 |