/[gzz]/manuscripts/FutureVision/oplan.txt
ViewVC logotype

Diff of /manuscripts/FutureVision/oplan.txt

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.15 by benja, Thu Nov 13 15:33:33 2003 UTC revision 1.16 by benja, Thu Nov 13 15:44:47 2003 UTC
# Line 202  Rewrite to introduce RDF briefly, then r Line 202  Rewrite to introduce RDF briefly, then r
202  the definition of hyperstructure above, then discuss it  the definition of hyperstructure above, then discuss it
203  in light of the "connotations" of hyperstructure.  in light of the "connotations" of hyperstructure.
204    
     .. The RDF structure (`Lassila and Swick 1999`_) is a graph containing  
        three types of nodes: Nodes identified globally by a URI,  
        "blank" nodes with identifiers local to a graph, and  
        *literals* (explicit values such as strings and numbers).  
        An RDF graph is a set of triples containing a *subject*,  
        *predicate* and *object* nodes (literals can only occur  
        as objects), which are interpreted as edges in the graph;  
        the subject and object are vertices, the predicate  
        is a label.  
   
       
   
205      Our work is based on using the Resource Description Framework      Our work is based on using the Resource Description Framework
206      (RDF, `Lassila and Swick 1999`_) as a hyperstructure.      (RDF, `Lassila and Swick 1999`_) as a hyperstructure.
207      In the examples we have given above, we have assumed the use of RDF.      In the examples we have given above, we have assumed the use of RDF.
# Line 235  in light of the "connotations" of hypers Line 223  in light of the "connotations" of hypers
223      to the same item by using different properties. Properties      to the same item by using different properties. Properties
224      are the RDF equivalent to zzstructure's dimensions.      are the RDF equivalent to zzstructure's dimensions.
225    
226        RDF triples are not associated with a context.
227        For example, one cannot create two triples saying that
228        "Paper A supports paper B" and "Paper A contradicts paper B,"
229        and then say that the first triple is true under one set
230        of assertions and the second under another set.
231    
232        To represent this information in RDF, one would not
233        use a direct connection between the papers; rather,
234        one would create new nodes for both statements,
235        and connect them to the two papers as well as to the
236        sets of assetions under which either statement is true.
237        (This is how statements about more than two nodes
238        are generally represented in RDF.)
239    
240      Visualizations of RDF... [keep current paragraphs here]      Visualizations of RDF... [keep current paragraphs here]
241      ...herculean task.      ...herculean task.
242    
# Line 562  say how they're moving towards an unifie Line 564  say how they're moving towards an unifie
564  -----------------------------------------  -----------------------------------------
565    
566    
567    Acknowledgements
568    ================
569    
570    Mention all people that have been in the group,
571    i.e. also Katariina Ervasti, Rauli Ruohonen, Kimmo Wideroos.
572    
573    Thank anonymous referees.

Legend:
Removed from v.1.15  
changed lines
  Added in v.1.16

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26