anchor.diff:  * Metadata Score
   +
   Metadata Score represents how much the endpoint contains metadata
  -defined in .
  +defined in <<3>>.
   +
   First we retrieve a list of graphs in the endpoint using a query
   described in Listing <<query_for_a_list_of_graphs>>.
  
positive.code: * Linked Data Rule
  +
  The endpoints are preferred to be satisfied with the four rules of
  linked data.
  +
  .We check four criteria:
  1.  Use URIs as names for things
  
negative.code:     \end{array}
      \right.]
  =====================================================================
  
  == References
  [[[1]]] Keith Alexander, Richard Cyganiak, Michael Hausenblas, and Jun
  Zhao. Describing linked datasets with the void vocabulary.
  https://www.w3.org/TR/void/, March 2011.
  
  [[[2]]] Tim Berners-Lee. Linked data - design issues.
  https://www.w3.org/DesignIssues/LinkedData.html, 2006.
  
  [[[3]]] DBCLS. Sparql queries for sparql builder metadata.
  http://www.sparqlbuilder.org/doc/sparql-queries-for-sparql-buildermetadata/.
  
  [[[4]]] Leigh Dodds and Ian Davis. Linked data patterns - a pattern
  catalogue for modelling, publishing, and consuming linked data.
  http://patterns.dataincubator.org, 2012.
  
  [[[5]]] Leo Sauermann and Richard Cyganiak. Cool uris for the semantic web.
  https://www.w3.org/TR/cooluris/, Descember 2008.
  