- From: pat hayes <phayes@ai.uwf.edu>
- Date: Thu, 12 Jul 2001 14:03:16 -0700
- To: jos.deroo.jd@belgium.agfa.com
- Cc: w3c-rdfcore-wg@w3.org
> > On the contrary: I consider it essential that the > > abstract syntax has a distinguished representation > > for anonymous nodes, and that the interpretation > > of these anonymous nodes in the abstract syntax > > works like existentially quantified variables > > in FOPL. > > > > I've given test cases and running code (n-triples2kif.pl) > > to support this position; I believe Pat H and > > somebody else agreed with me. > >based on what we have testcased at >http://www.agfa.com/w3c/euler/#Problem >I completely agree with you and I really >wonder how else we could model/infer >http://www.agfa.com/w3c/euler/tpoint-result.n3 or >http://www.agfa.com/w3c/euler/tpoint-all.n3 The answer is that in RDF, you *can't* infer this stuff. You use N3, which is way more expressive than RDF; it has negation and universal quantifiers, just for a start. Pat Hayes --------------------------------------------------------------------- (650)859 6569 w (650)494 3973 h (until September) phayes@ai.uwf.edu http://www.coginst.uwf.edu/~phayes
Received on Thursday, 12 July 2001 17:03:20 UTC