Proposal for Extending New Linked Data Rules for the Semantic Web - Foundations on Natural and Artificial Computation - page 531

3. Offering information on the resources using RDF.
4. Including links to other URIs to locate more linked data.

The first three rules refer to the same elements that must be considered in
the semantic annotation process. The fourth rule, which in fact gives the data
link a name, prescribes using hyperlinks to external semantic information from
the website whose content is being formally represented. This article analyses
the current trend in Linked Data developments, which implies analysing cer-
tain aspects of the semantic annotation strategy. We raise several considerations
(section 2) that start fundamentally from the problem of consistency and updat-
ing of semantic content annotation from the current authorship of the annota-
tions and link. These considerations will later lead us to make some proposals for
extending the Linked Data rules (section 3) that aim to help the aforementioned
problems by improving the update frequency of the semantic data and introduc-
ing coherence between content and formally represented data. The evaluation of
these ideas (section 4) is based on the results obtained with the sw2sws tool ,
which is a tool that populates ontologies that have been located as similar or ap-
proximate from html content pages. A description is also given of how generated
semantic websites (rule 1, 2 and 3) can be used by a semantic search engine (in
our case Vissem ) to obtain the data link indirectly (rule 4). Finally, the article
ends with some conclusions.

2 Considerations about the Current Four Rules

The Semantic Web has to interconnect the semantic contents, as the Linked
Data fourth rule establishes. Yet in addition to this, several aspects that are
key for the generalised acceptance of this concept and for (extended) migration
towards a Semantic Web should be considered.

link authorship
The simplest way of producing linked data consists of using a file, an URI
that points to another. When an RDF file is written, for example 1 ,< http://
example.criado.info/smith >, local identifiers can be used in it, so that we
could refer to the identifiers #albert, #brian and #carol, which in N3 2 notation
we will express as: <#albert> fam:child <#brian>, <#carol>.
AndinRDFas:
<rdf :Description about="#albert"
<fam: child rdf :Resource="#brian">
<fam : c h i l d r d f : Re s ou r c e="#c a r o l ">
</ r d f : D e s c r i p t i o n >

Consideration 1:

The current architecture of the WWW provides a global identifier " http://
example.criado.info/smith#albert " for “Albert”, i.e. anyone can use this
identifier to refer to “Albert” and thus provide more information. For example,

1 http://www.w3.org/DesignIssues/LinkedData.html
2 http://www.w3.org/DesignIssues/Notation3