W3C home > Mailing lists > Public > public-prov-wg@w3.org > March 2013

Re: PROV-ISSUE-638 (TomDN): Notation of set of key-value pairs in contraints of PROV Dictionary [PROV-DICTIONARY]

From: Paolo Missier <Paolo.Missier@ncl.ac.uk>
Date: Thu, 07 Mar 2013 14:20:25 +0000
Message-ID: <5138A229.2010908@ncl.ac.uk>
To: public-prov-wg@w3.org
Hi,

I went back to James' review and I am not sure what an inference that derives KV1 = KV2 means, when KV1 and KV2 are ground. For
example, what do we make of

derivedByInsertionFrom(d2, d1, {(3,e1)} ),
derivedByInsertionFrom(d2, d1, {(4,e2)})

?
I think I need to understand this better

--Paolo


On 07/03/2013 10:45, Provenance Working Group Issue Tracker wrote:
> PROV-ISSUE-638 (TomDN): Notation of set of key-value pairs in contraints of PROV Dictionary [PROV-DICTIONARY]
>
> http://www.w3.org/2011/prov/track/issues/638
>
> Raised by: Tom De Nies
> On product: PROV-DICTIONARY
>
> Came up in the review by James, but was agreed to be handled after the first WD release.
>
> We need to get consensus of the group whether the notation KV1=KV2 is acceptable for constraints D9, D10, D11, D12.4, and D12.5, and whether considering equalities on sets of keys/KV pairs is a potential complication.
> https://dvcs.w3.org/hg/prov/raw-file/default/dictionary/releases/WD-prov-dictionary-20130312/Overview.html#impossible-removal-insertion-constraint
>
>
>


-- 
-----------  ~oo~  --------------
Paolo Missier - Paolo.Missier@newcastle.ac.uk, pmissier@acm.org 
School of Computing Science, Newcastle University,  UK
http://www.cs.ncl.ac.uk/people/Paolo.Missier
PGP Public key: 0x45596549  - key servers: pool.sks-keyservers.net
Received on Thursday, 7 March 2013 14:20:57 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 21:58:23 UTC