- From: Yuzhong Qu <yzqu@seu.edu.cn>
- Date: Thu, 1 Jul 2004 23:23:29 +0800
- To: "pat hayes" <phayes@ihmc.us>, "Jeremy Carroll" <jjc@hpl.hp.com>
- Cc: "www-archive" <www-archive@w3.org>
Let <N,V,U,B,L> be a set of Named Graphs, and A a subset of dom(N) representing the accepted graphs in some given situation (e.g. an agent, called Alice, accepts some graphs). Based on the definition of the meaning of the accepted Named Graphs <A,N>, I have some thoughts as follows: 1. Accepted graphs are merged, so an URI occuring in two accepted graphs must has a unique meaning for the concerned agent, e.g. Alice. However, in many cases, Alice may accept two different views on a same thing (these two views may conflict), or two accepted views use a same URI to denote different things. Alice knows that, but the current framework doesn't provide a mechanism to cope with these issues. 2. Within an accepted graph, there is a triple saying some unaccepted graph is a truth, or one graph log:implies another graph (or other properties, such as eg:premise and eg:conclusion, are used) . How about the meaning of these constructs? Any comment is welcome! Yuzhong Qu
Received on Thursday, 1 July 2004 11:20:59 UTC