edited table: border in CSS, caption, to get HTML5 conformance
authorGuus Schreiber <guus.schreiber@vu.nl>
Thu, 06 Feb 2014 12:30:30 +0100
changeset 1817 f512f900b1eb
parent 1816 6e5cbb45eca1
child 1818 a6ad795892dd
edited table: border in CSS, caption, to get HTML5 conformance
rdf-mt/index.html
--- a/rdf-mt/index.html	Wed Feb 05 22:36:57 2014 +0000
+++ b/rdf-mt/index.html	Thu Feb 06 12:30:30 2014 +0100
@@ -87,8 +87,6 @@
 .othertable {background-color: #FDFDFD; padding:0.5em;}
 .tabletitle {font-size: small; font-weight: bolder;}
 
-table { border: 1px solid black;}
-
 .technote {
     font-size:small;
     margin: 2em 0em 0em;
@@ -137,6 +135,10 @@
     background-color: #ffeecc;
     border: 1px solid black
 }
+
+  table { border-style: outset; border-width: 1px; border-spacing: 2px; }
+  table td { border-style: inset; border-width: 1px; }
+
 </style>
   </head>
   <body>
@@ -296,8 +298,8 @@
 
 <p>A <dfn>simple interpretation</dfn> I is a structure consisting of:</p>
 
-<div class="tabletitle">Definition of a simple interpretation.</div>
 <table>
+<caption>Definition of a simple interpretation.</caption>
   <tr>
         <td class="semantictable">1. A non-empty set IR of resources, called the domain or universe
             of I.
@@ -332,11 +334,9 @@
   rules, where the interpretation is also treated as a function from expressions (names, triples and graphs) to elements of the universe and truth values:</p>
 
 
-  <div class="tabletitle">Semantic conditions for ground graphs.</div>
   <table>
+  <caption>Semantic conditions for ground graphs.</caption>
         <tbody>
-
-
           <tr>
       <td class="semantictable">if E is a literal then I(E) = IL(E)</td>
           </tr>
@@ -376,11 +376,9 @@
 
 <p> Suppose I is a simple interpretation and A is a mapping from a set of blank nodes to the universe IR of I. Define the mapping [I+A] to be I on <a>name</a>s, and A on blank nodes on the set: [I+A](x)=I(x) when x is a <a>name</a> and [I+A](x)=A(x) when x is a blank node; and extend this mapping to triples and RDF graphs using the rules given above for ground graphs. Then the semantic conditions for an RDF graph are:</p>
 
-    <div  class="tabletitle">Semantic condition for blank nodes.</div>
       <table>
+      <caption>Semantic condition for blank nodes.</caption>
         <tbody>
-
-
           <tr>
             <td class="semantictable">If E is an RDF graph then I(E) = true if [I+A](E) =
             true for some mapping A from the set of blank nodes in E to IR, otherwise
@@ -525,8 +523,8 @@
 <section id="D_interpretations"><h2>D-interpretations</h2>
 <p>Let D be a set of IRIs <a>identify</a>ing datatypes. A  <strong>(simple)</strong> <dfn>D-interpretation</dfn> is a <a>simple interpretation</a>  which satisfies the following conditions:</p>
 
-<div  class="tabletitle">Semantic conditions for datatyped literals.</div>
 <table>
+<caption>Semantic conditions for datatyped literals.</caption>
     <tbody>
 <tr><td class="semantictable">If <code>rdf:langString</code> is in D, then for every language-tagged string E with lexical form sss and language tag ttt, IL(E)= &lt; sss, ttt' &gt;, where ttt' is ttt converted to lower case using US-ASCII rules </td></tr>
 
@@ -612,20 +610,19 @@
 
 
 <p>An <dfn>RDF interpretation</dfn> <strong>recognizing D</strong> is a <a>D-interpretation</a> I where D includes <code>rdf:langString</code> and <code>xsd:string</code>, and which satisfies:</p>
-<div class="tabletitle">RDF semantic conditions.</div>
+
 <table>
+<caption>RDF semantic conditions.</caption>
   <tbody>
     <tr>
       <td class="semantictable" id="rdfsemcond1">x is
         in IP if and only if &lt;x, I(<code>rdf:Property</code>)&gt; is in IEXT(I(<code>rdf:type</code>))</td>
     </tr>
 <tr><td class="semantictable" id="rdfsemcond3">For every IRI aaa in D, &lt; x, I(aaa) &gt; is in IEXT(I(<code>rdf:type</code>)) if and only if x is in the value space of I(aaa)</td></tr>
-
-
   </tbody>
 </table>
     <p>and satisfies every triple in the following infinite set:</p>
- <div class="tabletitle">RDF axioms.</div>
+ <caption>RDF axioms.</caption>
 
   <table>
     <tr>
@@ -666,8 +663,8 @@
 <section class="informative"><h4 id="rdf_entailment_patterns">Patterns of RDF entailment (Informative)</h4>
 <p> The last semantic condition in the above table gives the following entailment pattern for <a>recognize</a>d datatype IRIs: </p>
 
-<div class="tabletitle">RDF entailment pattern.</div>
 <table>
+<caption>RDF entailment pattern.</caption>
   <tbody>
     <tr>
       <th > </th>
@@ -780,8 +777,8 @@
 <p> An <dfn>RDFS interpretation</dfn> (<strong>recognizing D</strong>) is an <a>RDF interpretation</a> (recognizing D) I
    which satisfies the semantic conditions in the following table, and all the triples in the subsequent table of RDFS axiomatic triples. </p>
 
-<div class="tabletitle">RDFS semantic conditions.</div>
   <table>
+  <caption>RDFS semantic conditions.</caption>
     <tr>
 
     <td class="semantictable" id="rdfssemcond1"> <p>ICEXT(y) is defined to be { x : &lt; x,y &gt; is in IEXT(I(<code>rdf:type</code>)) }</p>
@@ -853,8 +850,8 @@
 
     <p>
 	</p>
-	  <div class="tabletitle">RDFS axiomatic triples.</div>
   <table id="RDFS_axiomatic_triples">
+     <caption>RDFS axiomatic triples.</caption>
 
           <tr>
 
@@ -927,8 +924,9 @@
 
 <p>  Other triples which must be true in all RDFS interpretations
   include the following. This is not a complete set.</p>
-  <div class="tabletitle">Some rdfs-valid triples.</div>
+
 <table>
+  <caption>Some rdfs-valid triples.</caption>
   <tr>
     <td class="ruletable"><code>rdfs:Resource rdf:type rdfs:Class .<br/>
       rdfs:Class rdf:type rdfs:Class .<br/>
@@ -987,8 +985,8 @@
 
 <P>RDFS entailment holds for all the following patterns, which correspond closely to the RDFS semantic conditions:</p>
 
-<div class="title">RDFS entailment patterns.</div>
 <table>
+<caption>RDFS entailment patterns.</caption>
   <tbody>
     <tr >
       <th ></th>
@@ -1153,8 +1151,8 @@
 <!--<p>Define a <dfn>generalized RDF triple</dfn> to be a triple &lt;x, y, z&gt; where x and z can be an IRI, a blank node or a literal, and y can be an IRI or a blank node; and extend this to the rest of RDF, so that a generalized RDF graph is a set of generalized RDF triples. -->
 <p>Consider <a class="externalDFN" href="http://www.w3.org/TR/rdf11-concepts/#section-generalized-rdf">generalized RDF triples, graphs, and datasets</a> instead of RDF triples, graphs and datasets (extending the generalization used in [[HORST04]] and following exactly the terms used in [[OWL2-PROFILES]]).  The semantics described in this document applies to the generalization without change, so that the notions of interpretation, satisfiability and entailment can be used freely. Then we can replace the first RDF entailment pattern with the simpler and more direct</p>
 
-<div class="tabletitle">G-RDF-D entailment pattern.</div>
 <table>
+<caption>G-RDF-D entailment pattern.</caption>
   <tbody>
     <tr>
       <th > </th>