Re: log:forSome (Was: Model-specific identity for anon resources, and its representation: A new issue?

[...]
>>I agree that you CANT unify distinct existentially quantified
>>variables in the sense that one does with universally
>>quantified variables i.e. computing a MGU (Most General Unifier)
>>but what we actually compute is a LCU (Least Common Unifier)
>
>Whoa!  Ive never heard that term before. Can you specify what you
>mean? Eg give a sketch of this LCU algorithm, or some explanatory
>examples?

To make a sketch will take some time for me and
to analyze the
  final boolean unify(Euler t, Euler r, Stack s)
method in the class
  http://www.agfa.com/w3c/euler/Euler.java
will take some time for you
but examples are easier to find

1.given the facts http://www.agfa.com/w3c/euler/danc.n3
  then some query http://www.agfa.com/w3c/euler/danc-query.n3
  produces result http://www.agfa.com/w3c/euler/danc-result.n3

2.given the facts http://www.agfa.com/w3c/n3/ziv.n3
  then some query http://www.agfa.com/w3c/n3/ziv-query.n3
  produces result http://www.agfa.com/w3c/n3/ziv-result.n3

3.given the facts http://www.agfa.com/w3c/euler/simulteq.axiom.n3
  then some query http://www.agfa.com/w3c/euler/simulteq.lemma.n3
  produces result http://www.agfa.com/w3c/euler/simulteq.proof.n3

4.given the facts http://www.agfa.com/w3c/n3/rdfc25May.n3
  then some query http://www.agfa.com/w3c/n3/rdfc25May.n3
  produces result http://www.agfa.com/w3c/n3/rdfc25May-result.n3

--
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/

Received on Monday, 25 June 2001 12:20:19 UTC