--- a/ldp-bp/ldp-bp.html Wed Sep 11 23:34:40 2013 -0400
+++ b/ldp-bp/ldp-bp.html Fri Sep 13 09:08:56 2013 -0500
@@ -85,6 +85,31 @@
// document unless you know what you're doing. If in doubt ask your friendly neighbourhood
// Team Contact.
wgPatentURI : "http://www.w3.org/2004/01/pp-impl/55082/status",
+ localBiblio: {
+ "LD-DI": {
+ title: "Linked Data - Design Issues",
+ href: "http://www.w3.org/DesignIssues/LinkedData.html",
+ authors: ["Tim Berners-Lee"],
+ //status: "WD"//,
+ //deliveredBy: [
+ // "http://www.w3.org/2012/ldp/"
+ //],
+ //publisher: "W3C"
+ },
+ "LDP-TESTS": {
+ title: "Linked Data Platform 1.0 Test Cases",
+ href: "https://dvcs.w3.org/hg/ldpwg/raw-file/tip/Test%20Cases/LDP%20Test%20Cases.html",
+ authors: [
+ "Raúl García-Castro"
+ ],
+ status: "WD",
+ deliveredBy: [
+ "http://www.w3.org/2012/ldp/"
+ ],
+ publisher: "W3C"
+ }
+ }
+
};
// Replaces HTML characters (brackets and quotes) with legal HTML representations
@@ -105,7 +130,7 @@
}
</script>
-
+
</head>
<body>
@@ -260,9 +285,7 @@
referred to by HTTP URIs can actually be looked up
("dereferenced"). This important principle was originally
outlined by Tim Berners-Lee as rule #2 of "the four
- rules" for linking data in his 2006 publication, <a
- href="http://www.w3.org/DesignIssues/LinkedData.html">Linked
- Data - Design Issues</a>. It is therefore ideal that predicate URIs
+ rules" for linking data [[LD-DI]]]. It is therefore ideal that predicate URIs
identify LDPRs with representations that are retrievable. LDP
servers should at least provide [[RDF-SCHEMA]] representations of
these predicates where possible.