Very good starting point. Formally may I suggest we could use logic programming notation such (X, FN:name, "John Smith") The evaluation result would then be either bindings for X or if closure is a requirement, we would return all triples with X bound to a different value. I would like to see closure implemented with the query language in order to enable refined queries over the result graph. Let me post another email about inference. Janne -- Janne Saarela <janne.saarela@profium.com> Profium, Lars Sonckin kaari 12, 02600 Espoo, Finland Tel. +358 (0)9 855 98 000 Fax. +358 (0)9 855 98 002 Mob. +358 (0)40 508 4767 Internet: http://www.profium.comReceived on Thursday, 11 March 2004 09:30:59 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Thursday, 1 October 2009 14:41:55 GMT