- From: RDF Data Shapes Working Group Issue Tracker <sysbot+tracker@w3.org>
- Date: Fri, 19 Dec 2014 04:01:08 +0000
- To: public-data-shapes-wg@w3.org
shapes-ISSUE-18 (S35 examples): S35 needs to state what constraints are required http://www.w3.org/2014/data-shapes/track/issues/18 Raised by: Peter Patel-Schneider On product: S35 https://www.w3.org/2014/data-shapes/wiki/User_Stories#S35:_Describe_disconnected_graphs talks about constraints over disconnected graphs. However, it does not state why disconnected graphs are different from connected graphs? Are the constraints supposed to recognize disconnected graphs? Or are the constraints just supposed to work on disconnected graphs, and what differences in constraint handling are required for disconnected graphs. SPIN and OWL constraints don't care whether a graph is connected or disconnected.
Received on Friday, 19 December 2014 04:01:09 UTC