- From: pat hayes <phayes@ai.uwf.edu>
- Date: Mon, 28 Oct 2002 16:08:23 -0600
- To: dave.beckett@bristol.ac.uk
- Cc: w3c-rdfcore-wg@w3.org
Received on Monday, 28 October 2002 17:08:35 UTC
1. section 2.1 para 1 delete 'also' para 3 "A graph can be considered a sequence of paths of the form Node, Arc, Node, Arc, Node, Arc, ... which walk the entire graph." reads oddly to me: it suggests that all graphs must be a single connected path. In fact, most graphs cannot be traversed in this way (without backtracking, at any rate). Maybe if you said "....a collection of paths.... which together cover the entire graph" it would read better. Minor point. On the whole, a *super* document. First time I have ever understood what 'striped syntax' means. Pat -- --------------------------------------------------------------------- IHMC (850)434 8903 home 40 South Alcaniz St. (850)202 4416 office Pensacola (850)202 4440 fax FL 32501 (850)291 0667 cell phayes@ai.uwf.edu http://www.coginst.uwf.edu/~phayes
Received on Monday, 28 October 2002 17:08:35 UTC