DanC: what's new since the previous release?
sandro: I thought this was actually the first one really released, though they've been talking about it for ages.
Seth: or download from
DanC: previous/original release was 2001-05-15
Seth: also see documentation
DanC: hmm... the OpenCyc vocab says "Copyright? 1996 - 2002 Cycorp All rights reserved."; what's OpenSource about that? how's that any better/different from the proprietary cyc vocab?
bijan: Er..Open Source software usually maintains copyright. Indeed, reserving all rights is what lets you licence the work.
dajobe: the sourceforge site says LGPL License, which is presumably only the software
DanC: ok, so "all rights reserved" is noise. I wonder what the license for the vocab and docs is.
sandro: I thought this was actually the first one really released, though they've been talking about it for ages.
Seth: or download from
DanC: previous/original release was 2001-05-15
Seth: also see documentation
DanC: hmm... the OpenCyc vocab says "Copyright? 1996 - 2002 Cycorp All rights reserved."; what's OpenSource about that? how's that any better/different from the proprietary cyc vocab?
bijan: Er..Open Source software usually maintains copyright. Indeed, reserving all rights is what lets you licence the work.
dajobe: the sourceforge site says LGPL License, which is presumably only the software
DanC: ok, so "all rights reserved" is noise. I wonder what the license for the vocab and docs is.
sandro: My as-simple-as-possible and probably-workable proposal. Still drafty/not implemented.
sandro: N3 rules run afoul of how log:forAll and log:forSome work. Are they magic syntax? They might be made to work -- this is VERY similar, but I think this is easier to get right. This doesn't rely on establishing a mapping of n3 formulas to RDF.
sandro: N3 rules run afoul of how log:forAll and log:forSome work. Are they magic syntax? They might be made to work -- this is VERY similar, but I think this is easier to get right. This doesn't rely on establishing a mapping of n3 formulas to RDF.
Seth: "We seem to be in violent agreement." Pat Hayes :)
Seth: but will this be enough to keep plesh from namimg unnamed nodes ?
sandro: I'm still waiting for a real example of when Skolemizing (naming unnamed nodes) is a bad idea. Pat's assessment may be right -- that it's a "sociological" thing -- but in that case we need several classes of names (eg subproperties of UNAME).
connolly: real example: "There is a book with title 'ABC' and author Fred". If you write that in two documents, they entail each other. Once you skolemize them, this is no longer the case.
Seth: in my example about the round blue balls, it's consistent with the bnode that I own two or more round blue balls, but that is not the same as when we name the node. Try dollars: I have a dollar named Sue. Or I have some dollars. Means something very different.
Seth: but will this be enough to keep plesh from namimg unnamed nodes ?
sandro: I'm still waiting for a real example of when Skolemizing (naming unnamed nodes) is a bad idea. Pat's assessment may be right -- that it's a "sociological" thing -- but in that case we need several classes of names (eg subproperties of UNAME).
connolly: real example: "There is a book with title 'ABC' and author Fred". If you write that in two documents, they entail each other. Once you skolemize them, this is no longer the case.
Seth: in my example about the round blue balls, it's consistent with the bnode that I own two or more round blue balls, but that is not the same as when we name the node. Try dollars: I have a dollar named Sue. Or I have some dollars. Means something very different.
Key Free Trust in the Semantic Web: Does Google Show How the Semantic Web Could Replace Public Key Infrastructure?
AaronSw: by Joseph M. Reagle Jr.
AaronSw: see also Zooko's Law: Decentralized, Secure, Human-Memorizable: Choose Two
AaronSw: you can probably skip past the intro, right to his main point: "The pervasive use of digest values to identify the statements in the Semantic Web will engender a preponderance of evidence for trust without cryptography."
AaronSw: he seems to be solving the problem of how-do-i-find-the-key, not MITM attacks, which is sort of confusing.
AaronSw: see also Zooko's Law: Decentralized, Secure, Human-Memorizable: Choose Two
AaronSw: you can probably skip past the intro, right to his main point: "The pervasive use of digest values to identify the statements in the Semantic Web will engender a preponderance of evidence for trust without cryptography."
AaronSw: he seems to be solving the problem of how-do-i-find-the-key, not MITM attacks, which is sort of confusing.