tag:old.nabble.com,2006:forum-11593Nabble - w3.org - cwm2009-10-29T06:28:27ZCwm (pronounced coom) is a general-purpose data processor for the semantic web, somewhat like sed, awk, etc. for text files or XSLT for XML. It is a forward chaining reasoner which can be used for querying, checking, transforming and filtering information. Its core language is RDF, extended to include rules, and it uses RDF/XML or RDF/N3 (see Notation3 Primer) serializations as required. w3.org - cwm home is <a href="http://www.w3.org/2000/10/swap/doc/cwm.html" target="_top" rel="nofollow">here</a>.tag:old.nabble.com,2006:post-26114630cwm bug - no 'version' option?2009-10-29T06:28:27Z2009-10-29T06:28:27ZMartin ThurnYou should add a command-line option such as --version so we know what version of cwm we have. It might make bug reports more accurate, too 8-)
<br><br> - - Martin
<br><br><br><br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-bugs-f11595.html" embed="fixTarget[11595]" target="_top" >w3.org - public-cwm-bugs</a></p>tag:old.nabble.com,2006:post-26114631cwm bug - deprecation warnings with python 2.62009-10-29T06:25:22Z2009-10-29T06:25:22ZMartin ThurnOn Fedora Core 11 with Python 2.6, cwm spits out several warnings:
<br><br>/usr/lib/python2.6/site-packages/swap/why.py:30: DeprecationWarning: the md5 module is deprecated; use hashlib instead
<br> import md5, binascii # for building md5 URIs
<br>#Processed by Id: cwm.py,v 1.197 2007/12/13 15:38:39 syosi Exp
<br> # using base file:///home/thurnma/Work/workspace/SHARDS_API/
<br>/usr/lib/python2.6/site-packages/swap/term.py:1655: DeprecationWarning: object.__new__() takes no parameters
<br> self = Fragment.__new__(cls, *args, **keywords)
<br>/usr/lib/python2.6/site-packages/swap/cwm_crypto.py:15: DeprecationWarning: the sha module is deprecated; use the hashlib module instead
<br> import md5, sha, binascii, quopri, base64
<br><br> - - Martin
<br><br><br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-bugs-f11595.html" embed="fixTarget[11595]" target="_top" >w3.org - public-cwm-bugs</a></p>tag:old.nabble.com,2006:post-26108514Re: Converting a Natural Language Parse Tree to Notation32009-10-29T01:10:43Z2009-10-29T01:10:43Znaudts guidoHallo,
<br>I have nothing to add to the remarks of Tim;
<br>right to the point!
<br>Guido
<br><br>
<br>Guido Naudts
<br>Lic. zoologie
<br>Ir.informatica
<br>Adviseur Department of Justice
<br>Secretarisdreef 5
<br>2288 Bouwel
<br>Belgium
<br><br><br><br>----- Original Message ----
<br>From: Tim rdf <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=26108514&i=0" target="_top" rel="nofollow">timrdf@...</a>>
<br>To: Chris Spencer <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=26108514&i=1" target="_top" rel="nofollow">chrisspen@...</a>>
<br>Cc: naudts guido <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=26108514&i=2" target="_top" rel="nofollow">naudts_vannoten@...</a>>; <a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=26108514&i=3" target="_top" rel="nofollow">public-cwm-talk@...</a>
<br>Sent: Fri, October 16, 2009 6:12:46 PM
<br>Subject: Re: Converting a Natural Language Parse Tree to Notation3
<br><br>I would:
<br>1) avoid bothering with minting number IDs for each node; just let
<br>the bnode carry it.
<br>2) Use 'a' instead of :tag.
<br><br> (PP
<br> of/IN
<br> (NP
<br> the/DT
<br> company/NN
<br> )
<br> )
<br><br>@prefix pos: <<a href="http://eg.com/parts-of-speech#" target="_top" rel="nofollow">http://eg.com/parts-of-speech#</a>>
<br><br>[ a pos:PP;
<br> pos:comprises (
<br> [ pos:string "of"; a pos:IN ]
<br> ( a pos:NP;
<br> pos:comprises (
<br> [ pos:string "the"; a pos:DT ]
<br> [ pos:string "company"; a pos:NN ]
<br> )
<br> )
<br>)
<br>] .
<br><br><br><br>-Tim
<br><br><br>On Fri, Oct 16, 2009 at 11:27 AM, Chris Spencer <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=26108514&i=4" target="_top" rel="nofollow">chrisspen@...</a>> wrote:
<div class='shrinkable-quote'><br>> On Fri, Oct 16, 2009 at 10:37 AM, naudts guido
<br>> <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=26108514&i=5" target="_top" rel="nofollow">naudts_vannoten@...</a>> wrote:
<br>>> Hallo,
<br>>> this can be converted to N3 in the following manner:
<br>>> [:node "some_node eg VP"; :parentNode "parentNode1; :children ("childnode1" ..."childNoden")].
<br>>> Then you can query eg give all childnodes of VP:
<br>>> [:node "VP"; :children ?a].
<br>>> where ?a will be replaced by the children.
<br>>> (I translate XML to N3 in this manner).
<br>>> Of course you can easily add other characteristics to a node.
<br>>> With kind regards,
<br>>
<br>> Interesting, thanks.
<br>>
<br>> Just to clarify though, are you using the grammar tags as unique
<br>> identifiers? Isn't this impossible, since multiple nodes use the same
<br>> grammar tags (e.g. there are multiple VP nodes)?
<br>>
<br>> Wouldn't you instead store the grammar tag in a separate attribute like:
<br>> [:node "2103738"; :tag "VP"; :parentNode "9073"; :children("98732987"
<br>> "342323241" ...)]
<br>>
<br>> and then query it like:
<br>> [:node ?a; :tag "VP"; :children ?a]
<br>> ?
<br>>
<br>> Regards,
<br>> Chris
<br>>
<br>>
</div><br><br><br>
<br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25928968Re: Converting a Natural Language Parse Tree to Notation32009-10-16T10:10:51Z2009-10-16T10:10:51ZCerinThanks Tim! That clarifies a lot.
<br><br>Regards,
<br>Chris
<br><br>On Fri, Oct 16, 2009 at 12:12 PM, Tim rdf <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25928968&i=0" target="_top" rel="nofollow">timrdf@...</a>> wrote:
<div class='shrinkable-quote'><br>> I would:
<br>> 1) avoid bothering with minting number IDs for each node; just let
<br>> the bnode carry it.
<br>> 2) Use 'a' instead of :tag.
<br>>
<br>> (PP
<br>> of/IN
<br>> (NP
<br>> the/DT
<br>> company/NN
<br>> )
<br>> )
<br>>
<br>> @prefix pos: <<a href="http://eg.com/parts-of-speech#" target="_top" rel="nofollow">http://eg.com/parts-of-speech#</a>>
<br>>
<br>> [ a pos:PP;
<br>> pos:comprises (
<br>> [ pos:string "of"; a pos:IN ]
<br>> ( a pos:NP;
<br>> pos:comprises (
<br>> [ pos:string "the"; a pos:DT ]
<br>> [ pos:string "company"; a pos:NN ]
<br>> )
<br>> )
<br>> )
<br>> ] .
<br>>
<br>>
<br>>
<br>> -Tim
<br>>
<br>>
<br>> On Fri, Oct 16, 2009 at 11:27 AM, Chris Spencer <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25928968&i=1" target="_top" rel="nofollow">chrisspen@...</a>> wrote:
<br>>> On Fri, Oct 16, 2009 at 10:37 AM, naudts guido
<br>>> <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25928968&i=2" target="_top" rel="nofollow">naudts_vannoten@...</a>> wrote:
<br>>>> Hallo,
<br>>>> this can be converted to N3 in the following manner:
<br>>>> [:node "some_node eg VP"; :parentNode "parentNode1; :children ("childnode1" ..."childNoden")].
<br>>>> Then you can query eg give all childnodes of VP:
<br>>>> [:node "VP"; :children ?a].
<br>>>> where ?a will be replaced by the children.
<br>>>> (I translate XML to N3 in this manner).
<br>>>> Of course you can easily add other characteristics to a node.
<br>>>> With kind regards,
<br>>>
<br>>> Interesting, thanks.
<br>>>
<br>>> Just to clarify though, are you using the grammar tags as unique
<br>>> identifiers? Isn't this impossible, since multiple nodes use the same
<br>>> grammar tags (e.g. there are multiple VP nodes)?
<br>>>
<br>>> Wouldn't you instead store the grammar tag in a separate attribute like:
<br>>> [:node "2103738"; :tag "VP"; :parentNode "9073"; :children("98732987"
<br>>> "342323241" ...)]
<br>>>
<br>>> and then query it like:
<br>>> [:node ?a; :tag "VP"; :children ?a]
<br>>> ?
<br>>>
<br>>> Regards,
<br>>> Chris
<br>>>
<br>>>
<br>>
</div><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25928087Re: Converting a Natural Language Parse Tree to Notation32009-10-16T09:12:46Z2009-10-16T09:12:46ZtimrdfI would:
<br>1) avoid bothering with minting number IDs for each node; just let
<br>the bnode carry it.
<br>2) Use 'a' instead of :tag.
<br><br> (PP
<br> of/IN
<br> (NP
<br> the/DT
<br> company/NN
<br> )
<br> )
<br><br>@prefix pos: <<a href="http://eg.com/parts-of-speech#" target="_top" rel="nofollow">http://eg.com/parts-of-speech#</a>>
<br><br>[ a pos:PP;
<br> pos:comprises (
<br> [ pos:string "of"; a pos:IN ]
<br> ( a pos:NP;
<br> pos:comprises (
<br> [ pos:string "the"; a pos:DT ]
<br> [ pos:string "company"; a pos:NN ]
<br> )
<br> )
<br> )
<br>] .
<br><br><br><br>-Tim
<br><br><br>On Fri, Oct 16, 2009 at 11:27 AM, Chris Spencer <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25928087&i=0" target="_top" rel="nofollow">chrisspen@...</a>> wrote:
<div class='shrinkable-quote'><br>> On Fri, Oct 16, 2009 at 10:37 AM, naudts guido
<br>> <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25928087&i=1" target="_top" rel="nofollow">naudts_vannoten@...</a>> wrote:
<br>>> Hallo,
<br>>> this can be converted to N3 in the following manner:
<br>>> [:node "some_node eg VP"; :parentNode "parentNode1; :children ("childnode1" ..."childNoden")].
<br>>> Then you can query eg give all childnodes of VP:
<br>>> [:node "VP"; :children ?a].
<br>>> where ?a will be replaced by the children.
<br>>> (I translate XML to N3 in this manner).
<br>>> Of course you can easily add other characteristics to a node.
<br>>> With kind regards,
<br>>
<br>> Interesting, thanks.
<br>>
<br>> Just to clarify though, are you using the grammar tags as unique
<br>> identifiers? Isn't this impossible, since multiple nodes use the same
<br>> grammar tags (e.g. there are multiple VP nodes)?
<br>>
<br>> Wouldn't you instead store the grammar tag in a separate attribute like:
<br>> [:node "2103738"; :tag "VP"; :parentNode "9073"; :children("98732987"
<br>> "342323241" ...)]
<br>>
<br>> and then query it like:
<br>> [:node ?a; :tag "VP"; :children ?a]
<br>> ?
<br>>
<br>> Regards,
<br>> Chris
<br>>
<br>>
</div><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25927296Re: Converting a Natural Language Parse Tree to Notation32009-10-16T08:27:31Z2009-10-16T08:27:31ZCerinOn Fri, Oct 16, 2009 at 10:37 AM, naudts guido
<br><<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25927296&i=0" target="_top" rel="nofollow">naudts_vannoten@...</a>> wrote:
<br>> Hallo,
<br>> this can be converted to N3 in the following manner:
<br>> [:node "some_node eg VP"; :parentNode "parentNode1; :children ("childnode1" ..."childNoden")].
<br>> Then you can query eg give all childnodes of VP:
<br>> [:node "VP"; :children ?a].
<br>> where ?a will be replaced by the children.
<br>> (I translate XML to N3 in this manner).
<br>> Of course you can easily add other characteristics to a node.
<br>> With kind regards,
<br><br>Interesting, thanks.
<br><br>Just to clarify though, are you using the grammar tags as unique
<br>identifiers? Isn't this impossible, since multiple nodes use the same
<br>grammar tags (e.g. there are multiple VP nodes)?
<br><br>Wouldn't you instead store the grammar tag in a separate attribute like:
<br>[:node "2103738"; :tag "VP"; :parentNode "9073"; :children("98732987"
<br>"342323241" ...)]
<br><br>and then query it like:
<br>[:node ?a; :tag "VP"; :children ?a]
<br>?
<br><br>Regards,
<br>Chris
<br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25913336Re: Converting a Natural Language Parse Tree to Notation32009-10-15T11:02:34Z2009-10-15T11:02:34ZCerinOn Thu, Oct 15, 2009 at 11:36 AM, Tim rdf <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25913336&i=0" target="_top" rel="nofollow">timrdf@...</a>> wrote:
<div class='shrinkable-quote'><br>> (List folk: please let us know if this is off topic for this list)
<br>>
<br>> Chris,
<br>>
<br>> Do you have any current non-N3 representations of your example sentence?
<br>>
<br>> I am not familiar with building parse trees, but if you have a current
<br>> format I'd be show you a N3-version of it.
<br>>
<br>> Regards,
<br>> Tim Lebo
</div><br>Thanks. I'm not sure what the definitive parsing would be, but below
<br>is a manual parsing edited from the chunked output from MontyLingua.
<br><br>I've formatted it to appear as an s-expression, indented for clarity,
<br>but I apologize if the indentation is lost in the email.
<br><br>(S
<br> (NP
<br> The/DT
<br> meeting/NN
<br> (PP
<br> of/IN
<br> (NP
<br> the/DT
<br> shareholders/NNS
<br> (PP
<br> of/IN
<br> (NP
<br> the/DT
<br> company/NN
<br> )
<br> )
<br> )
<br> )
<br> )
<br> (VA
<br> (VP
<br> shall/MD
<br> be/VB
<br> held/VBN
<br> )
<br> (PP
<br> at/IN
<br> (NP
<br> a/DT
<br> place/NN
<br> (VA
<br> (VP
<br> deemed/VBN
<br> )
<br> (NP
<br> appropriate/JJ
<br> (PP
<br> by/IN
<br> (NP
<br> a/DT
<br> majority/JJ
<br> vote/NN
<br> (PP
<br> of/IN
<br> (NP
<br> the/DT
<br> shareholders/NNS
<br> )
<br> )
<br> (PP
<br> to/TO
<br> (VA
<br> (VP
<br> be/VB
<br> determined/VBN
<br> )
<br> (NP
<br> no/RB
<br> less/RBR
<br> (PP
<br> than/IN
<br> (NP
<br> a/DT
<br> month/NN
<br> (PP
<br> before/IN
<br> (NP
<br> the/DT
<br> meeting/NN
<br> )
<br> )
<br> )
<br> )
<br> )
<br> (NP
<br> and/CC
<br> no/DT
<br> more/JJR
<br> (PP
<br> than/IN
<br> (NP
<br> six/CD
<br> months/NNS
<br> (PP
<br> before/IN
<br> (NP
<br> the/DT
<br> meeting/NN
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br> )
<br>)
<br><br>Regards,
<br>Chris
<br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25910838Re: Converting a Natural Language Parse Tree to Notation32009-10-15T08:36:15Z2009-10-15T08:36:15Ztimrdf(List folk: please let us know if this is off topic for this list)
<br><br>Chris,
<br><br>Do you have any current non-N3 representations of your example sentence?
<br><br>I am not familiar with building parse trees, but if you have a current
<br>format I'd be show you a N3-version of it.
<br><br>Regards,
<br>Tim Lebo
<br><br>On Thu, Oct 15, 2009 at 11:07 AM, Chris Spencer <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25910838&i=0" target="_top" rel="nofollow">chrisspen@...</a>> wrote:
<div class='shrinkable-quote'><br>> I apologize if this isn't the place for N3 questions, but I can't seem
<br>> to find a dedicated public forum for N3.
<br>>
<br>> Is N3 descriptive enough to represent an arbitrarily complex parse
<br>> tree for a sentence? I've been reading over the spec, but I'm finding
<br>> it a little unintuitive, and most of the examples don't approach the
<br>> complexity of natural language.
<br>>
<br>> I'm curious to see if I can take natural language text, generate a
<br>> parse tree, and convert it into N3, which I can then more easily query
<br>> using a semantic reasoner like CWM.
<br>>
<br>> For example, given the lengthy sentence, "The meeting of the
<br>> shareholders of the company shall be held at a place deemed
<br>> appropriate by a majority vote of the shareholders, to be determined
<br>> no less then a month before the meeting and no more than 6 months
<br>> before the meeting", how would that look in N3?
<br>>
<br>> I think I grasp the "x of y of z" form to look like :z!:y!:x in N3,
<br>> and simple SVO forms to look like ":s :v :o" in N3, but I don't see
<br>> how more complicated nested structures would look. How does N3
<br>> represent prepositions like "at" and "to", nested triples, or logical
<br>> AND and OR statements? Is there an existing namespace for common
<br>> English vocabulary, like "determined", "before", etc?
<br>>
<br>> Regards,
<br>> Chris
<br>>
<br>>
</div><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25910318Converting a Natural Language Parse Tree to Notation32009-10-15T08:07:08Z2009-10-15T08:07:08ZCerinI apologize if this isn't the place for N3 questions, but I can't seem
<br>to find a dedicated public forum for N3.
<br><br>Is N3 descriptive enough to represent an arbitrarily complex parse
<br>tree for a sentence? I've been reading over the spec, but I'm finding
<br>it a little unintuitive, and most of the examples don't approach the
<br>complexity of natural language.
<br><br>I'm curious to see if I can take natural language text, generate a
<br>parse tree, and convert it into N3, which I can then more easily query
<br>using a semantic reasoner like CWM.
<br><br>For example, given the lengthy sentence, "The meeting of the
<br>shareholders of the company shall be held at a place deemed
<br>appropriate by a majority vote of the shareholders, to be determined
<br>no less then a month before the meeting and no more than 6 months
<br>before the meeting", how would that look in N3?
<br><br>I think I grasp the "x of y of z" form to look like :z!:y!:x in N3,
<br>and simple SVO forms to look like ":s :v :o" in N3, but I don't see
<br>how more complicated nested structures would look. How does N3
<br>represent prepositions like "at" and "to", nested triples, or logical
<br>AND and OR statements? Is there an existing namespace for common
<br>English vocabulary, like "determined", "before", etc?
<br><br>Regards,
<br>Chris
<br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25656111Re: FW: Installation problem2009-09-28T18:59:03Z2009-09-28T18:59:03ZDavid Booth-6It looks like I'm having an installation problem that may be similar to
<br>what I reported in January 2008:
<br><a href="http://lists.w3.org/Archives/Public/public-cwm-bugs/2008Jan/0002.html" target="_top" rel="nofollow">http://lists.w3.org/Archives/Public/public-cwm-bugs/2008Jan/0002.html</a><br><br>Per the README, I unpacked the tar file and did:
<br><br> cd test ; make post-install
<br><br>That initially failed because I don't have a command called python2.4
<br>installed. (I'm on Ubuntu, and have python 2.5.2.) So I modified the
<br>Makefile to define 'P=python' instead of 'P=python2.4', and now it runs
<br>successfully through many of the tests, but fails on or after test
<br>111/159. The error is:
<br>[[
<br>111/159 sparql/detailed.tests#t1001 sparql builtins from cwm
<br>Traceback (most recent call last):
<br> File "../cwm", line 750, in <module>
<br> doCommand()
<br> File "../cwm", line 617, in doCommand
<br> think(workingContext, mode=option_flags["think"])
<br> File "/downloads/cwm/cwm-1.2.1/swap/query.py", line 88, in think
<br> return InferenceTask(knowledgeBase, ruleFormula, mode=mode, why=why,
<br>repeat=1).run()
<br> File "/downloads/cwm/cwm-1.2.1/swap/query.py", line 262, in run
<br> return self.runSmart()
<br> File "/downloads/cwm/cwm-1.2.1/swap/query.py", line 250, in runSmart
<br> total += cy.run()
<br> File "/downloads/cwm/cwm-1.2.1/swap/query.py", line 413, in run
<br> return rule.once()
<br> File "/downloads/cwm/cwm-1.2.1/swap/query.py", line 557, in once
<br> total = query.resolve()
<br> File "/downloads/cwm/cwm-1.2.1/swap/query.py", line 840, in resolve
<br> k = self.matchFormula(self.statements, self.variables,
<br>self._existentialVariables)
<br> File "/downloads/cwm/cwm-1.2.1/swap/query.py", line 1015, in
<br>matchFormula
<br> nbs = item.tryBuiltin(queue, bindings, evidence=evidence)
<br> File "/downloads/cwm/cwm-1.2.1/swap/query.py", line 1676, in
<br>tryBuiltin
<br> result = pred.evalObj(subj, BNone, BNone, proof, BNone)
<br> File "/downloads/cwm/cwm-1.2.1/swap/cwm_sparql.py", line 344, in
<br>evalObj
<br> F = self.store.load(inputURI, contentType="x-application/sparql")
<br> File "/downloads/cwm/cwm-1.2.1/swap/llyn.py", line 1609, in load
<br> referer=referer, why=why)
<br> File "/downloads/cwm/cwm-1.2.1/swap/webAccess.py", line 195, in load
<br> p = sparql_parser.N3Parser(StringIO.StringIO(buffer),
<br>sparql_parser.branches, convertor)
<br> File "/downloads/cwm/cwm-1.2.1/swap/sparql/sparql_parser.py", line 47,
<br>in __init__
<br> lexer = sparql_tokens.Lexer()
<br> File "/downloads/cwm/cwm-1.2.1/swap/sparql/sparql_tokens.py", line
<br>272, in __init__
<br> self.fixTokens()
<br> File "/downloads/cwm/cwm-1.2.1/swap/sparql/sparql_tokens.py", line
<br>314, in fixTokens
<br> importTokens()
<br> File "/downloads/cwm/cwm-1.2.1/swap/sparql/sparql_tokens.py", line 31,
<br>in importTokens
<br> from sparql_tokens_table import tokens as ts, regexps as rs
<br> File "/downloads/cwm/cwm-1.2.1/swap/sparql/sparql_tokens_table.py",
<br>line 90, in <module>
<br> u'c_http://www.w3.org/2000/10/swap/grammar/sparql#VAR2':
<br>re.compile(u'\\$[A-Za-z\xc0-\xd6\xd8-\xf6\xf8-\u02ff\u0370-\u037d
<br>\u037f-\u1fff\u200c-\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff
<br>\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff][_0-9A-Za-z\xb7\xc0-\xd6
<br>\xd8-\xf6\xf8-\u02ff\u0300-\u036f\u0370-\u037d\u037f-\u1fff\u200c-\u200d
<br>\u203f-\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf
<br>\ufdf0-\ufffd\U00010000-\U000effff]*', re.I),
<br> File "/usr/local/lib/python2.5/re.py", line 188, in compile
<br> return _compile(pattern, flags)
<br> File "/usr/local/lib/python2.5/re.py", line 241, in _compile
<br> raise error, v # invalid expression
<br>sre_constants.error: bad character range
<br>Files differ, result= 256
<br># If this is OK, cp ,temp/sparql_query1_result.rl
<br>sparql/query1_result.rl
<br>######### Differences from reference output:
<br>--- sparql/query1_result.rl 2007-11-16 10:49:31.000000000 -0500
<br>+++ ,temp/sparql_query1_result.rl 2009-09-28 21:37:02.748026548 -0400
<br>@@ -1,58 +0,0 @@
<br>-<?xml version="1.0"?>
<br>-
<br>-
<br>-<sparql xmlns="<a href="http://www.w3.org/2005/sparql-results#" target="_top" rel="nofollow">http://www.w3.org/2005/sparql-results#</a>">
<br>-
<br>- <head>
<br>- <variable name="friend"/>
<br>- <variable name="blurb"/>
<br>- <variable name="age"/>
<br>- <variable name="mbox"/>
<br>- <variable name="name"/>
<br>- <variable name="hpage"/>
<br>- <variable name="x"/>
<br>- </head>
<br>-
<br>- <results>
<br>- <result>
<br>- <binding name="friend">
<br>-
<br><bnode><a href="http://example.com/swap/test/run#_bnode_0" target="_top" rel="nofollow">http://example.com/swap/test/run#_bnode_0</a></bnode>
<br>- </binding>
<br>- <binding name="blurb">
<br>- <literal
<br>datatype="<a href="http://www.w3.org/1999/02/22-rdf-syntax-ns#XMLLiteral" target="_top" rel="nofollow">http://www.w3.org/1999/02/22-rdf-syntax-ns#XMLLiteral</a>"><p
<br>xmlns="<a href="http://www.w3.org/1999/xhtml" target="_top" rel="nofollow">http://www.w3.org/1999/xhtml</a>">My name is
<br><em>Alice</em></p></literal>
<br>- </binding>
<br>- <binding name="mbox">
<br>- <literal></literal>
<br>- </binding>
<br>- <binding name="name">
<br>- <literal>Alice</literal>
<br>- </binding>
<br>- <binding name="hpage">
<br>- <uri><a href="http://work.example.org/alice/" target="_top" rel="nofollow">http://work.example.org/alice/</a></uri>
<br>- </binding>
<br>- <binding name="x">
<br>-
<br><bnode><a href="http://example.com/swap/test/run#_bnode_1" target="_top" rel="nofollow">http://example.com/swap/test/run#_bnode_1</a></bnode>
<br>- </binding>
<br>- </result>
<br>- <result>
<br>- <binding name="friend">
<br>-
<br><bnode><a href="http://example.com/swap/test/run#_bnode_2" target="_top" rel="nofollow">http://example.com/swap/test/run#_bnode_2</a></bnode>
<br>- </binding>
<br>- <binding name="age">
<br>- <literal
<br>datatype="<a href="http://www.w3.org/2001/XMLSchema#integer" target="_top" rel="nofollow">http://www.w3.org/2001/XMLSchema#integer</a>">30</literal>
<br>- </binding>
<br>- <binding name="mbox">
<br>- <uri>mailto:<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25656111&i=0" target="_top" rel="nofollow">bob@...</a></uri>
<br>- </binding>
<br>- <binding name="name">
<br>- <literal xml:lang="en">Bob</literal>
<br>- </binding>
<br>- <binding name="hpage">
<br>- <uri><a href="http://work.example.org/bob/" target="_top" rel="nofollow">http://work.example.org/bob/</a></uri>
<br>- </binding>
<br>- <binding name="x">
<br>-
<br><bnode><a href="http://example.com/swap/test/run#_bnode_3" target="_top" rel="nofollow">http://example.com/swap/test/run#_bnode_3</a></bnode>
<br>- </binding>
<br>- </result>
<br>- </results>
<br>-</sparql>
<br><br>######### from normal case sparql_query1_result.rl: cwm -n3
<br>sparql/sparql_builtin1.n3 --think --strings
<br>make: *** [post-install] Error 255
<br><br>]]
<br><br>P.S. The cwm-1.2.1 README file seems to be suspiciously out of
<br>date:
<br>[[
<br>$Id: README,v 1.11 2005/11/21 22:19:31 vkolovsk Exp $
<br> . . .
<br>== What's New In this Release (1.2.0) ==
<br>]]
<br><br><br><br>--
<br>David Booth, Ph.D.
<br>Cleveland Clinic (contractor)
<br><br>Opinions expressed herein are those of the author and do not necessarily
<br>reflect those of Cleveland Clinic.
<br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-bugs-f11595.html" embed="fixTarget[11595]" target="_top" >w3.org - public-cwm-bugs</a></p>tag:old.nabble.com,2006:post-25597261Re: RIF implementation experience? Re: Yet another release of FuXi2009-09-24T08:17:40Z2009-09-24T08:17:40ZChimezie OgbujiReply inline below:
<br><br>On Thu, Sep 24, 2009 at 11:01 AM, Dan Connolly <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=25597261&i=0" target="_top" rel="nofollow">connolly@...</a>> wrote:
<br>> Interesting... have you started playing with RIF?
<br>> I gather the WG is getting pretty close to done,
<br>> but I haven't managed to give it a close look myself.
<br><br>Yes, I have (for some time actually). Currently, the core, internal
<br>rule API mimics an earlier version of the RIF BLD abstract syntax.
<br>So, when N3 is parsed it is (internally) converted into a completely
<br>object-oriented set of RIF rules. I use the ability to override
<br>__repr__ in Python as the mechanism for serializing a RIF ruleset
<br>constructed in this way into the human readable syntax of RIF BLD.
<br>OWL2 RL documents (at least the subset of this profile that intersects
<br>with OWL-DL) can be converted into a corresponding RIF ruleset:
<br><br><a href="http://code.google.com/p/fuxi/wiki/FuXiUserManual#FuXi_.DLP" target="_top" rel="nofollow">http://code.google.com/p/fuxi/wiki/FuXiUserManual#FuXi_.DLP</a><br><br>Support for the XML syntax has been put off for post 1.0 (which
<br>unfortunately is necessary in order to test compliance via the
<br>recently developed RIF test suite)
<br><br>The RIF Core rule safety criteria has been implemented. See:
<br><br><a href="http://code.google.com/p/fuxi/wiki/FuXiUserManual#Rule_Safety" target="_top" rel="nofollow">http://code.google.com/p/fuxi/wiki/FuXiUserManual#Rule_Safety</a><br><br>Also, the PML proofs generated from top-down (backward chaining)
<br>solution to answers uses the RIF BLD human readable syntax for the
<br>conclusions of NodeSets.
<br><br>-- Chimezie
<br><br>>
<br>> <a href="http://www.w3.org/TR/rif-bld/" target="_top" rel="nofollow">http://www.w3.org/TR/rif-bld/</a><br>>
<br><br>-- Chimezie
<br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25596908RIF implementation experience? Re: Yet another release of FuXi2009-09-24T08:01:08Z2009-09-24T08:01:08ZDan ConnollyChimezie wrote:
<br>> See:
<br>> - <a href="http://pypi.python.org/pypi/FuXi/1.0-rc-II.dev" target="_top" rel="nofollow">http://pypi.python.org/pypi/FuXi/1.0-rc-II.dev</a><br>> - <a href="http://code.google.com/p/fuxi/source/detail?r=fce0195ff8a2b728a7c86825309a66fe4ec37e3c" target="_top" rel="nofollow">http://code.google.com/p/fuxi/source/detail?r=fce0195ff8a2b728a7c86825309a66fe4ec37e3c</a><br><br><br>Interesting... have you started playing with RIF?
<br>I gather the WG is getting pretty close to done,
<br>but I haven't managed to give it a close look myself.
<br><br><a href="http://www.w3.org/TR/rif-bld/" target="_top" rel="nofollow">http://www.w3.org/TR/rif-bld/</a><br><div class='shrinkable-quote'><br>> Besides bug fixes, the main highlights are: updated support for non-
<br>> monotonic negation in both forward and backward chaining inference.
<br>> I've updated the user manual and overview regarding this capability:
<br>>
<br>> Also, the backward chainer now attempts to collect as many subgoals
<br>> (consequents for rules) that it can to send over as a single SPARQL
<br>> query against the base RDF datasest. There have also been significant
<br>> performance improvements to the top-down (backward chainer) via better
<br>> use of lazy list iteration.
<br>>
<br>> - <a href="http://code.google.com/p/fuxi/wiki/FuXiUserManual#Negation" target="_top" rel="nofollow">http://code.google.com/p/fuxi/wiki/FuXiUserManual#Negation</a><br>> - <a href="http://code.google.com/p/fuxi/wiki/Overview#Non-Monotonic_Negation" target="_top" rel="nofollow">http://code.google.com/p/fuxi/wiki/Overview#Non-Monotonic_Negation</a><br>>
</div><br>--
<br>Dan Connolly, W3C <a href="http://www.w3.org/People/Connolly/" target="_top" rel="nofollow">http://www.w3.org/People/Connolly/</a><br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25596676Yet another release of FuXi2009-09-24T07:47:14Z2009-09-24T07:47:14ZChimezie OgbujiSee:
<br>- <a href="http://pypi.python.org/pypi/FuXi/1.0-rc-II.dev" target="_top" rel="nofollow">http://pypi.python.org/pypi/FuXi/1.0-rc-II.dev</a><br>- <a href="http://code.google.com/p/fuxi/source/detail?r=fce0195ff8a2b728a7c86825309a66fe4ec37e3c" target="_top" rel="nofollow">http://code.google.com/p/fuxi/source/detail?r=fce0195ff8a2b728a7c86825309a66fe4ec37e3c</a><br><br>Besides bug fixes, the main highlights are: updated support for non-
<br>monotonic negation in both forward and backward chaining inference.
<br>I've updated the user manual and overview regarding this capability:
<br><br>Also, the backward chainer now attempts to collect as many subgoals
<br>(consequents for rules) that it can to send over as a single SPARQL
<br>query against the base RDF datasest. There have also been significant
<br>performance improvements to the top-down (backward chainer) via better
<br>use of lazy list iteration.
<br><br>- <a href="http://code.google.com/p/fuxi/wiki/FuXiUserManual#Negation" target="_top" rel="nofollow">http://code.google.com/p/fuxi/wiki/FuXiUserManual#Negation</a><br>- <a href="http://code.google.com/p/fuxi/wiki/Overview#Non-Monotonic_Negation" target="_top" rel="nofollow">http://code.google.com/p/fuxi/wiki/Overview#Non-Monotonic_Negation</a><br><br>CHANGELOG
<br><br>- Demorgan normal form doesn't flatten negated disjunctions if they
<br>are named, atomic classes
<br>- added reduce function for rendering MINUS SPARQL expressions:
<br>collapseMINUS
<br>- added support for handling of topdown resolution of theories with
<br>negation (network.negRules are in play for proof search space)
<br>- added calculation of stratified model to bottom up method
<br>- factored out adornment and IDB/EDB introspection
<br>- added proper support of adornment with negated literals
<br>- added serialization and compilation of proofs with negation
<br> - sparql resolvable method used to build large SPARQL queries to
<br>dispatch against the RDF dataset to solve for base predicates during
<br>evaluation of sip strategy
<br>- proof creation: support for conjunctive queries against based
<br>predicates as RDF dataset
<br>- queries to fact graph are only dispatched if they involve base
<br>predicates (otherwise, we must assume they are solved by the inference
<br>procedure)
<br>- updated Tests
<br>- added support for str:lessThan and log:equalTo to builtin SPARQL
<br>templates
<br>- fixed the interaction between --method=topDown, both, bottomUp (they
<br>were stepping on each other's setup)
<br>- simple atomic concept inclusion axioms (i.e., subClassOf between two
<br>named classes) are now solved in large groups rather than one at a
<br>time
<br>- fixed lazy collection of multiple answers for a subgoal (if the
<br>first answer is true, the rest are not processed)
<br>- added useful selective_memoize decorator and lazyGeneratorPeek to
<br>FuXi.Rete.Util
<br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-25592806RuleML-2009 Call for Participation -Earlybird Deadline Sept. 25th2009-09-24T03:33:45Z2009-09-24T03:33:45ZAdrian Paschke---------------------------------------------------------------------------
<br>Want to learn more about rule technologies, applications and standards?
<br>Want to discuss latest research results and developments?
<br>Want to get in touch with the industry and research experts in rule-based
<br>systems and technologies?
<br><br>Don't miss RuleML-2009 - early bird registration deadline ends on September
<br>25th
<br><br> <a href="http://2009.ruleml.org/registration" target="_top" rel="nofollow">http://2009.ruleml.org/registration</a><br>---------------------------------------------------------------------------
<br><br><br> RuleML 2009
<br>
<br>3rd International Symposium on Rules, Applications and Interoperability
<br> November 5-7 2009, Las Vegas, Nevada, USA
<br>
<br> <a href="http://2009.ruleml.org/" target="_top" rel="nofollow">http://2009.ruleml.org/</a><br><br> co-located with the 12th Business Rules Forum
<br><br> ----------------------------
<br><br>We cordially invite you to participate in the 3rd International Symposium on
<br>Rules, Applications and Interoperability (RuleML-2009) - the premier event
<br>addressing research, applications and standards for rule technologies and
<br>rule-based event processing technologies. It takes place in Las Vegas,
<br>Nevada, USA, Nov. 5-7, collocated with the 12th Business Rules Forum, the
<br>world's largest Business Rules event.
<br><br>RuleML-2009 has evolved from an annual series of international workshops
<br>since 2002, international conferences in 2005 and 2006, and international
<br>RuleML Symposia since 2007, to the premier event on rule-based systems
<br>addressing industry developments, standards and academic research at the
<br>same time. RuleML-2009 is in the top 100 venues for impact factor (71):
<br><a href="http://citeseerx.ist.psu.edu/stats/venues" target="_top" rel="nofollow">http://citeseerx.ist.psu.edu/stats/venues</a>. It is supported by W3C, OMG, ACM,
<br>EPTS, AAAI, ECCAI, IAAIL, ACM, Belgian Business Rules Forum, MIT Sloan CIO
<br>Symposium, BPM Forum Belgium and a listed EU ICT technology conference.
<br><br>We are building an excellent program with renowned experts as keynote
<br>speakers, tutorials, standards panel sessions, Open Source Day, W3C RIF
<br>workshop, Int. Rule Challenge with prestigious prizes, etc.
<br><br>MAKE RULEML-2009 YOUR SHOWCASE!
<br><br>Submit to the 3rd Int. Rule Challenge at <a href="http://2009.ruleml.org/challenge" target="_top" rel="nofollow">http://2009.ruleml.org/challenge</a><br>
<br><br>*******************************************************************
<br>RuleML-2009 highlights and news:
<br><br>* 3rd Int. Rule Challenge
<br><br>"Demonstration of benchmarks/evaluations, demos, case studies / use
<br>cases, experience reports, best practice solutions, rule-based
<br>implementations/ tools/ applications, demonstrations engineering methods,
<br>implementations of rule standards"
<br><br>* Rule Open Source Day
<br><br>"Discover how Open Source Rules solutions are being deployed in the
<br>marketplace and how they compare to proprietary solutions"
<br><br>* Lunch Panel on Standards for Business Rules
<br><br>"Want to learn more about latest business rules standard in W3C, OMG, OASIS,
<br>ISO, RuleML and how these apply in the enterprise business arena"
<br><br>* W3C Rule Interchange Format Standard Workshop
<br><br>* Keynotes and special talks by
<br> Sandro Hawke (W3C) about W3C RIF
<br> Donald Chapin (OMG) about OMG SBVR and ISO Terminology standards
<br><br> Paul Vincent (TIBCO) about CEP and Rules
<br> Jans Aasman (FranzInc. CEO)
<br><br>* Tutorials by
<br> Mark Proctor (Drools) - Drools Tutorial
<br> Christian Saint Marie (ILog/IBM) - W3C RIF Tutorial
<br> Larry Goldberg and Babara von Halle - Decision Management
<br> Guido Governatori (NICTA) - Business Process Compliance
<br><br>* Tracks on
<br> Rule-based Event Processing
<br> Rule Systems on the Web
<br> Rule Transformation and Extraction
<br> Process and Data
<br> Rules and Norms
<br> Rules and Uncertainty
<br><br>* RuleML-2009 Springer LNCS proceedings published
<br>* 3rd Rule Challenge CEUR proceedings to appear
<br>* IEEE TKDE special issue on Rule technologies to appear Dec. 2009
<br>* Forthcoming RuleML-2009 special journal issue
<br>*******************************************************************
<br><br><br>Supported by
<br>===================================================================
<br>W3C, OMG, ACM, AAAI, ECCAI, IAAIL, ACM, Belgian Business Rules Forum
<br>MIT Sloan CIO Symposium, EPTS, BPM Forum Belgium
<br><br>Sponsored by
<br>===================================================================
<br><br>BBN Technologies
<br>Franz Inc
<br>NICTA (National ICT Australia) Ltd
<br>Corporate Semantic Web
<br>Logic Programming Associated Ltd
<br>ruleCore
<br>JBoss RedHat
<br>Modelsystems Ltd
<br><br>(sponsoring opportunities: <a href="http://2009.ruleml.org/sponsors" target="_top" rel="nofollow">http://2009.ruleml.org/sponsors</a>)
<br>===================================================================
<br><br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24855003N3 formulation of RIF builtins [Was: fuXi not installing on AMD 64 + Ubuntu]2009-08-06T14:41:56Z2009-08-06T14:41:56Zjos.deroo<font size=2 face="sans-serif">[sorry for cross-posting with public-cwm-talk]</font>
<br>
<br><font size=2 face="sans-serif">Today I was able to make an initial
Eye rif-plugin plus test cases</font>
<br><font size=2 face="sans-serif">at </font><a href=http://eulersharp.sourceforge.net/2007/07test/rifP.n3 target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2007/07test/rifP.n3</font></a>
<br><font size=2 face="sans-serif">and the actual N3 formulation of RIF
builtins is following</font>
<br>
<br><font size=2 face="sans-serif">(args) func:xxx value.</font>
<br><font size=2 face="sans-serif">(args) pred:xxx true.</font>
<br>
<br><font size=2 face="sans-serif">which is different from what I said
before..</font>
<br>
<br><font size=2 face="sans-serif">The test result of</font>
<br>
<br><font size=2 face="sans-serif">eye --nope --plugin </font><a href="http://eulersharp.sourceforge.net/2006/02swap/rif-plugin.yap" target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2006/02swap/rif-plugin.yap</font></a><font size=2 face="sans-serif">
</font><a href=http://eulersharp.sourceforge.net/2007/07test/rifP.n3 target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2007/07test/rifP.n3</font></a><font size=2 face="sans-serif">
--query </font><a href=http://eulersharp.sourceforge.net/2007/07test/rifQ.n3 target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2007/07test/rifQ.n3</font></a>
<br>
<br><font size=2 face="sans-serif">is looking like</font>
<br>
<br><font size=2 face="sans-serif">#Processed by $Id: euler.yap 3080 2009-08-06
12:40:36Z josd $</font>
<br>
<br><font size=2 face="sans-serif">@prefix func: <</font><a href="http://www.w3.org/2007/rif-builtin-function#" target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.w3.org/2007/rif-builtin-function#</font></a><font size=2 face="sans-serif">>.</font>
<br><font size=2 face="sans-serif">@prefix pred: <</font><a href="http://www.w3.org/2007/rif-builtin-predicate#" target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.w3.org/2007/rif-builtin-predicate#</font></a><font size=2 face="sans-serif">>.</font>
<br><font size=2 face="sans-serif">@prefix e: <</font><a href="http://eulersharp.sourceforge.net/2003/03swap/log-rules#" target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2003/03swap/log-rules#</font></a><font size=2 face="sans-serif">>.</font>
<br><font size=2 face="sans-serif">@prefix : <</font><a href=http://eulersharp.sourceforge.net/2007/07test# target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2007/07test#</font></a><font size=2 face="sans-serif">>.</font>
<br><font size=2 face="sans-serif">@prefix var: <</font><a href=http://localhost/var# target="_top" rel="nofollow"><font size=2 face="sans-serif">http://localhost/var#</font></a><font size=2 face="sans-serif">>.</font>
<br><font size=2 face="sans-serif">@prefix r: <</font><a href=http://www.w3.org/2000/10/swap/reason# target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.w3.org/2000/10/swap/reason#</font></a><font size=2 face="sans-serif">>.</font>
<br><font size=2 face="sans-serif">@prefix n3: <</font><a href=http://www.w3.org/2004/06/rei# target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.w3.org/2004/06/rei#</font></a><font size=2 face="sans-serif">>.</font>
<br>
<br><font size=2 face="sans-serif">{((0 1 2) 3) func:append (0 1 2 3)}
a :PASS.</font>
<br><font size=2 face="sans-serif">{((0 1 2) 3 4) func:append (0 1 2 3
4)} a :PASS.</font>
<br><font size=2 face="sans-serif">{((1 1) (1) (1) ((1))) func:append (1
1 (1) (1) ((1)))} a :PASS.</font>
<br><font size=2 face="sans-serif">{(() 1) func:append (1)} a :PASS.</font>
<br><font size=2 face="sans-serif">{(1 1) func:numeric-add 2} a :PASS.</font>
<br><font size=2 face="sans-serif">{(5 2) func:numeric-divide 2.5} a :PASS.</font>
<br><font size=2 face="sans-serif">{(5 2) func:numeric-integer-divide 2}
a :PASS.</font>
<br><font size=2 face="sans-serif">{(10 3) func:numeric-mod 1} a :PASS.</font>
<br><font size=2 face="sans-serif">{(6 -2) func:numeric-mod 0} a :PASS.</font>
<br><font size=2 face="sans-serif">{(4.5 1.2) func:numeric-mod 0.9} a :PASS.</font>
<br><font size=2 face="sans-serif">{(123.0 6.0) func:numeric-mod 3.0} a
:PASS.</font>
<br><font size=2 face="sans-serif">{(5 2) func:numeric-multiply 10} a :PASS.</font>
<br><font size=2 face="sans-serif">{(5 2) func:numeric-subtract 3} a :PASS.</font>
<br><font size=2 face="sans-serif">{(1 1.0) pred:numeric-equal true} a
:PASS.</font>
<br><font size=2 face="sans-serif">{(1.0 0) pred:numeric-greater-than true}
a :PASS.</font>
<br><font size=2 face="sans-serif">{(1.0 1) pred:numeric-greater-than-or-equal
true} a :PASS.</font>
<br><font size=2 face="sans-serif">{(2.0 3) pred:numeric-less-than true}
a :PASS.</font>
<br><font size=2 face="sans-serif">{(3 5.0) pred:numeric-less-than-or-equal
true} a :PASS.</font>
<br><font size=2 face="sans-serif">{(1 1.01) pred:numeric-not-equal true}
a :PASS.</font>
<br><font size=2 face="sans-serif">{("""abracadabra"""
"""bra""") pred:matches true} a :PASS.</font>
<br><font size=2 face="sans-serif">{("""abracadabra"""
"""^a.*a$""") pred:matches true} a :PASS.</font>
<br>
<br>
<br><font size=2 face="sans-serif">#ENDS 8 msec</font>
<br>
<br>
<br><font size=2 face="sans-serif">Before doing the full set of builtins
in </font><a href="http://www.w3.org/TR/rif-dtb/" target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.w3.org/TR/rif-dtb/</font></a>
<br><font size=2 face="sans-serif">I just wanted to give this the benefit
of your thoughts (on both lists)</font>
<br>
<br><font size=2 face="sans-serif"><br>
Kind regards,<br>
<br>
Jos De Roo | Agfa HealthCare<br>
Senior Researcher | HE/Advanced Clinical Applications Research<br>
T +32 3444 7618<br>
</font><a href=http://www.agfa.com/w3c/jdroo target="_top" rel="nofollow" /><font size=2 face="sans-serif">http://www.agfa.com/w3c/jdroo/</font></a><font size=2 face="sans-serif"><br>
<br>
Quadrat NV, Kortrijksesteenweg 157, 9830 Sint-Martens-Latem, Belgium<br>
</font><a href=http://www.agfa.com/healthcare target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.agfa.com/healthcare</font></a>
<br>
<br>
<br>
<table width=100%>
<tr valign=top>
<td width=40%><font size=1 face="sans-serif"><b>Jos De Roo/AMDUS/AGFA</b></font>
<p><font size=1 face="sans-serif">07/21/2009 10:43 PM</font>
<td width=59%>
<table width=100%>
<tr valign=top>
<td>
<div align=right><font size=1 face="sans-serif">To</font></div>
<td><font size=1 face="sans-serif"><a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=0" target="_top" rel="nofollow">fuxi-discussion@...</a></font>
<tr valign=top>
<td>
<div align=right><font size=1 face="sans-serif">cc</font></div>
<td><font size=1 face="sans-serif"><a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=1" target="_top" rel="nofollow">fuxi-discussion@...</a>, Jean-Marc
Vanel <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=2" target="_top" rel="nofollow">jeanmarc.vanel@...</a>>, <a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=3" target="_top" rel="nofollow">uche@...</a></font>
<tr valign=top>
<td>
<div align=right><font size=1 face="sans-serif">Subject</font></div>
<td><font size=1 face="sans-serif">Re: fuXi not installing on AMD 64 +
Ubuntu</font><a href=Notes://BEMORDMAI01/412566130053ACBD/A4D87D90E1B19842852564FF006DED4E/4511D22941CFBEB7C12575FA006F7279 target="_top" rel="nofollow">Link</a></table>
<br>
<table>
<tr valign=top>
<td>
<td></table>
<br></table>
<br>
<br><font size=2 face="sans-serif">That is really excellent news Chimezie!</font>
<br>
<br><font size=2 face="sans-serif">Last night I also had some exchange
with Sandro but Eye will stick to N3</font>
<br><font size=2 face="sans-serif">and w.r.t. the n-ary builtins I think
we can express them in N3 as</font>
<br>
<br><font size=2 face="sans-serif">yyy func:xxx (args).</font>
<br><font size=2 face="sans-serif">_:void pred:xxx (args).</font>
<br>
<br><font size=2 face="sans-serif">and I am definitely prepared to invest
time to implement all of them either</font>
<br><font size=2 face="sans-serif">in the euler.yap code directly or as
a</font>
<br><font size=2 face="sans-serif">--plugin <yap_resource> command
line option such as e.g.</font>
<br><font size=2 face="sans-serif">eye --nope --plugin </font><a href=http://eulersharp.sourceforge.net/2007/07test/plugin.yap target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2007/07test/plugin.yap</font></a><font size=2 face="sans-serif">
--query </font><a href=http://eulersharp.sourceforge.net/2007/07test/pluginQ.n3 target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2007/07test/pluginQ.n3</font></a>
<br>
<br><font size=2 face="sans-serif"><br>
Kind regards,<br>
<br>
Jos De Roo | Agfa HealthCare<br>
Senior Researcher | HE/Advanced Clinical Applications Research<br>
T +32 3444 7618<br>
</font><a href=http://www.agfa.com/w3c/jdroo target="_top" rel="nofollow" /><font size=2 face="sans-serif">http://www.agfa.com/w3c/jdroo/</font></a><font size=2 face="sans-serif"><br>
<br>
Quadrat NV, Kortrijksesteenweg 157, 9830 Sint-Martens-Latem, Belgium<br>
</font><a href=http://www.agfa.com/healthcare target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.agfa.com/healthcare</font></a>
<br>
<br>
<br>
<table width=100%>
<tr valign=top>
<td width=40%><font size=1 face="sans-serif"><b>Chimezie Ogbuji <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=4" target="_top" rel="nofollow">chimezie@...</a>></b>
</font>
<br><font size=1 face="sans-serif">Sent by: <a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=5" target="_top" rel="nofollow">fuxi-discussion@...</a></font>
<p><font size=1 face="sans-serif">07/21/2009 10:17 PM</font>
<table border>
<tr valign=top>
<td bgcolor=white>
<div align=center><font size=1 face="sans-serif">Please respond to<br>
<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=6" target="_top" rel="nofollow">fuxi-discussion@...</a></font></div></table>
<br>
<td width=59%>
<table width=100%>
<tr valign=top>
<td>
<div align=right><font size=1 face="sans-serif">To</font></div>
<td><font size=1 face="sans-serif"><a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=7" target="_top" rel="nofollow">fuxi-discussion@...</a></font>
<tr valign=top>
<td>
<div align=right><font size=1 face="sans-serif">cc</font></div>
<td><font size=1 face="sans-serif">Jean-Marc Vanel <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=8" target="_top" rel="nofollow">jeanmarc.vanel@...</a>>,
<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=9" target="_top" rel="nofollow">uche@...</a></font>
<tr valign=top>
<td>
<div align=right><font size=1 face="sans-serif">Subject</font></div>
<td><font size=1 face="sans-serif">Re: fuXi not installing on AMD 64 +
Ubuntu</font></table>
<br>
<table>
<tr valign=top>
<td>
<td></table>
<br></table>
<br>
<br>
<br>
<br><tt><font size=2><br>
On Tue, Jul 21, 2009 at 2:29 PM, <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=10" target="_top" rel="nofollow">jos.deroo@...</a>> wrote:<br>
> Fuxi --input-format=n3 --output=n3 --ruleFacts --closure<br>
> --rules=http://www.w3.org/2000/10/swap/test/reason/t5.n3<br>
><br>
> runs fine and gives<br>
<br>
Hey Jos. Thanks for checking this out.<br>
<br>
> While at it, do you plan to have a --input-format=rif-xml<br>
> For Eye we don't plan one but it would be great to have your engine<br>
> connected for that :-)<br>
<br>
Yes, I do actually. Sandro just pointed me to the current test cases<br>
so I was going to get started on support for rif-xml serialization of<br>
rules<br>
<br>
-- Chimezie<br>
<br>
--~--~---------~--~----~------------~-------~--~----~<br>
You received this message because you are subscribed to the Google Groups
"fuxi-discussion" group.<br>
To post to this group, send email to <a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=11" target="_top" rel="nofollow">fuxi-discussion@...</a><br>
To unsubscribe from this group, send email to <a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24855003&i=12" target="_top" rel="nofollow">fuxi-discussion+unsubscribe@...</a><br>
For more options, visit this group at </font></tt><a href="http://groups.google.com/group/fuxi-discussion?hl=en" target="_top" rel="nofollow"><tt><font size=2>http://groups.google.com/group/fuxi-discussion?hl=en</font></tt></a><tt><font size=2><br>
-~----------~----~----~----~------~----~------~--~---<br>
<br>
</font></tt><font size=2 face="sans-serif"><br>
</font>
<br>
<br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24831581N3 spec. errors (editorial)2009-08-05T09:09:53Z2009-08-05T09:09:53ZBarclay, Daniel<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<META NAME="Generator" CONTENT="MS Exchange Server version 6.5.7654.12">
<TITLE>N3 spec. errors (editorial)</TITLE>
</HEAD>
<BODY>
<!-- Converted from text/plain format -->
<P><FONT SIZE=2>For any future editions of the N3 specification currently at<BR>
<A HREF="http://www.w3.org/TeamSubmission/n3/" target="_top" rel="nofollow">http://www.w3.org/TeamSubmission/n3/</A><BR>
(<A HREF="http://www.w3.org/TeamSubmission/2008/SUBM-n3-20080114/" target="_top" rel="nofollow">http://www.w3.org/TeamSubmission/2008/SUBM-n3-20080114/</A>), there are<BR>
a number of editorial errors. Here are some from the Introduction<BR>
and Grammar sections:<BR>
<BR>
<BR>
In the Introduction section:<BR>
<BR>
* It says:<BR>
<BR>
This language has ben developed ...<BR>
<BR>
* It says:<BR>
<BR>
This is a language which is a compact and readable alternative ...<BR>
<BR>
(That "which" should be "that.")<BR>
<BR>
* It says:<BR>
<BR>
The developer learning N3 is invited to try the A tutorial ...<BR>
<BR>
* It says<BR>
<BR>
... URI abbreviation using prefixes which are bound to a<BR>
namespace (using @prefix) a bit like in XML...<BR>
<BR>
(A comma seems to be missing before "a bit" (that the "which"<BR>
should be "that" or should have a comma before it).)<BR>
<BR>
<BR>
In the Grammar section:<BR>
<BR>
* It says:<BR>
<BR>
The grammar of N3 is defined by a context free grammar:<BR>
* Context-free grammar in N3<BR>
<BR>
(The (first) reference to "context free grammar" should have<BR>
the hyphen too.)<BR>
<BR>
* It says:<BR>
<BR>
N3 files are encoded in UTF-8 (See RFC2279), in normalized in<BR>
Normalization Form C.<BR>
<BR>
(Note the second occurrence of "in.")<BR>
<BR>
* It says:<BR>
<BR>
A full 32 unicode implementation would normally be preferable.<BR>
<BR>
<BR>
<BR>
<BR>
Also, the formatting of the non-normative text with both a<BR>
reduced-contrast color _and_ a reduced-contrast background color<BR>
makes it harder to read. Please consider ????<BR>
<BR>
Additionally, the text of the third paragraph of the "Status .." section<BR>
is in a fairly pale gray.<BR>
<BR>
<BR>
--<BR>
(Plain text sometimes corrupted to HTML "courtesy" of Microsoft Exchange.) [F]<BR>
<BR>
<BR>
</FONT>
</P>
</BODY>
</HTML><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24831527N3 spec. probable error2009-08-05T09:06:02Z2009-08-05T09:06:02ZBarclay, Daniel<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<META NAME="Generator" CONTENT="MS Exchange Server version 6.5.7654.12">
<TITLE>N3 spec. probable error</TITLE>
</HEAD>
<BODY>
<!-- Converted from text/plain format -->
<P><FONT SIZE=2>Regarding the N3 specification currently at<BR>
<A HREF="http://www.w3.org/TeamSubmission/n3/" target="_top" rel="nofollow">http://www.w3.org/TeamSubmission/n3/</A><BR>
(http://www.w3.org/TeamSubmission/2008/SUBM-n3-20080114/):<BR>
<BR>
In the Grammar section, it says:<BR>
<BR>
The fragment identifier part of a URI where the rest of<BR>
the URI is that of an information resource which has a<BR>
representation in N3 is used to identify any thing<BR>
whatever, abstract or concrete.<BR>
<BR>
Note that the current wording (unintentionally) says that it is just<BR>
the fragment identifier part of URI that identifies some thing, when<BR>
in reality is it the _whole_ URI that identifies it.<BR>
<BR>
Additionally, the restriction to having an information resource (let<BR>
alone the restriction to having one with an N3 representation) seems<BR>
excessively restrictive. Why can't a URI used in an N3 document<BR>
refer to a resource described in an RDF/XML document?<BR>
<BR>
<BR>
Daniel<BR>
--<BR>
(Plain text sometimes corrupted to HTML "courtesy" of Microsoft Exchange.) [F]<BR>
<BR>
<BR>
</FONT>
</P>
</BODY>
</HTML><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24753382Re: math:notLessThan2009-07-30T13:03:28Z2009-07-30T13:03:28ZTim Berners-Lee<html><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; ">Thanks! Updated when I next sync<div>Tim</div><div><br><div><div>On 2009-07 -22, at 15:03, <a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24753382&i=0" target="_top" rel="nofollow">jos.deroo@...</a> wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite"><font size="2" face="sans-serif">There is small typo at </font><a href="http://www.w3.org/2000/10/swap/doc/CwmBuiltins" target="_top" rel="nofollow"><font size="2" face="sans-serif">http://www.w3.org/2000/10/swap/doc/CwmBuiltins</font></a><font size="2" face="sans-serif"> in the math builtins</font> <br><font size="2" face="sans-serif">s/notlessThan/notLessThan</font> <br><font size="2" face="sans-serif">This is an observation from Sajjad</font> <br> <br><font size="2" face="sans-serif"><br> Kind regards,<br> <br> Jos De Roo | Agfa HealthCare<br> Senior Researcher | HE/Advanced Clinical Applications Research<br> T +32 3444 7618<br> </font><a href="http://www.agfa.com/w3c/jdroo/" target="_top" rel="nofollow"><font size="2" face="sans-serif">http://www.agfa.com/w3c/jdroo/</font></a><font size="2" face="sans-serif"><br> <br> Quadrat NV, Kortrijksesteenweg 157, 9830 Sint-Martens-Latem, Belgium<br> </font><a href="http://www.agfa.com/healthcare" target="_top" rel="nofollow"><font size="2" face="sans-serif">http://www.agfa.com/healthcare</font></a></blockquote></div><br></div></body></html><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24613051propositional formulae as classes2009-07-22T12:32:53Z2009-07-22T12:32:53Zjos.deroo<font size=2 face="sans-serif">Since a while I am thinking about propositional
formulae as classes</font>
<br><font size=2 face="sans-serif">and it is interesting to see that the
idea works out of the box in Cwm</font>
<br><font size=2 face="sans-serif">i.e.</font>
<br>
<br><font size=2 face="sans-serif">{:Headache :assessedBy :Physician} rdfs:subClassOf
{:Headache :assessedBy :PhysicalExam}.</font>
<br><font size=2 face="sans-serif">:pat001 a {:Headache :assessedBy :Physician}.</font>
<br>
<br><font size=2 face="sans-serif">plus</font>
<br>
<br><a href="http://eulersharp.sourceforge.net/2003/03swap/rdfs-subClassOf.n3" target="_top" rel="nofollow"><font size=2 face="sans-serif">http://eulersharp.sourceforge.net/2003/03swap/rdfs-subClassOf.n3</font></a>
<br>
<br><font size=2 face="sans-serif">entails</font>
<br>
<br><font size=2 face="sans-serif"> t:pat001
a {t:Headache t:assessedBy t:PhysicalExam .</font>
<br><font size=2 face="sans-serif"> },</font>
<br><font size=2 face="sans-serif">
{t:Headache t:assessedBy t:Physician .</font>
<br><font size=2 face="sans-serif"> } .</font>
<br>
<br><font size=2 face="sans-serif">which is also what Eye (Euler yap engine)
sees.</font>
<br>
<br><font size=2 face="sans-serif">The extension of such a class is possibly
the set of things</font>
<br><font size=2 face="sans-serif">for which the propositional formula
is the case.</font>
<br>
<br>
<br><font size=2 face="sans-serif"><br>
Kind regards,<br>
<br>
Jos De Roo | Agfa HealthCare<br>
Senior Researcher | HE/Advanced Clinical Applications Research<br>
T +32 3444 7618<br>
</font><a href=http://www.agfa.com/w3c/jdroo target="_top" rel="nofollow" /><font size=2 face="sans-serif">http://www.agfa.com/w3c/jdroo/</font></a><font size=2 face="sans-serif"><br>
<br>
Quadrat NV, Kortrijksesteenweg 157, 9830 Sint-Martens-Latem, Belgium<br>
</font><a href=http://www.agfa.com/healthcare target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.agfa.com/healthcare</font></a><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24612545math:notLessThan2009-07-22T12:03:01Z2009-07-22T12:03:01Zjos.deroo<font size=2 face="sans-serif">There is small typo at </font><a href=http://www.w3.org/2000/10/swap/doc/CwmBuiltins target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.w3.org/2000/10/swap/doc/CwmBuiltins</font></a><font size=2 face="sans-serif">
in the math builtins</font>
<br><font size=2 face="sans-serif">s/notlessThan/notLessThan</font>
<br><font size=2 face="sans-serif">This is an observation from Sajjad</font>
<br>
<br><font size=2 face="sans-serif"><br>
Kind regards,<br>
<br>
Jos De Roo | Agfa HealthCare<br>
Senior Researcher | HE/Advanced Clinical Applications Research<br>
T +32 3444 7618<br>
</font><a href=http://www.agfa.com/w3c/jdroo target="_top" rel="nofollow" /><font size=2 face="sans-serif">http://www.agfa.com/w3c/jdroo/</font></a><font size=2 face="sans-serif"><br>
<br>
Quadrat NV, Kortrijksesteenweg 157, 9830 Sint-Martens-Latem, Belgium<br>
</font><a href=http://www.agfa.com/healthcare target="_top" rel="nofollow"><font size=2 face="sans-serif">http://www.agfa.com/healthcare</font></a><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24263911Re: qname shortland starting with a digit2009-06-29T16:50:11Z2009-06-29T16:50:11ZtimrdfAndy,<br><br>Thanks for the information. <br><br>Looks like SPARQL made some very convenient decisions. Thanks, WG!<br><br>-Tim Lebo<br><br><br><div class="gmail_quote">On Mon, Jun 29, 2009 at 1:18 PM, Andy Seaborne <span dir="ltr"><<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24263911&i=0" target="_top" rel="nofollow">andy.seaborne@...</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"><div class="im"><br>
<br>
Tim rdf wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Luc,<br>
<br>
Sesame 2.2.4 does not handle digits at the start of the local part of a QName, either. (Perhaps 3.0b does, but I haven't found the time)<br>
<br>
Jena 2.5.4 and Jena 2.6.0 do, however.<br>
<br>
Rather annoying behavior. I heard claims of "Historic XML namespace QName compliance", but Saxon handles elements with "digit names" in Plain Old XML....<br>
<br>
Does anyone know why tools are mixed on how they handled digits in QNames? I would imagine that it would be a natural desire.<br>
</blockquote>
<br>
<br></div>
The Jena reader is adhering to the principle of being permissive in what it accepts. The Jena readers for Turtle are derived from SPARQL where the local part of a prefixed name does allow a digit as the start char.<br>
<br>
QNames (as in the XML Namespaces concept) do not allow the local part to start with digit. SPARQL does not call it's abbreviations "qnames".<br>
<br>
Turtle submission:<br>
"""<br>
10. Turtle compared to SPARQL<br>
...<br>
# SPARQL allows '.'s in names in all positions apart from the first or last.<br>
# SPARQL allows digits in the first character of the PN_LOCAL lexical token. In Turtle, the only ascii characters allowed in a nameStartChar are [A-Z] | "_" | [a-z].<br>
"""<br>
<br>
SPARQL changed to allow the leading digits in the local part during the time of the original working group based on quite a lot of user input.<br>
<br>
I don't know of any reason not to accept digits at the start of the local part. For URIs derived from other naming schemes, it comes up naturally and forcing full forms <>, or strange prefix choices, adds no value.<br>
<br>
Andy<br>
<br>
<br>
<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<br>
Regards,<br>
Tim Lebo<div class="im"><br>
<br>
On Mon, Apr 27, 2009 at 5:49 AM, luc peuvrier at home <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24263911&i=1" target="_top" rel="nofollow">lc.pvrr@...</a><mailto:<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24263911&i=2" target="_top" rel="nofollow">lc.pvrr@...</a>>> wrote:<br>
Hi,<br>
<br>
For the following uri <<a href="http://tap.xmlns.com/data/7UpBrand" target="_blank" rel="nofollow">http://tap.xmlns.com/data/7UpBrand</a>><br>
<br>
A n3 file can contains:<br>
<br>
@prefix data: <<a href="http://tap.xmlns.com/data/" target="_blank" rel="nofollow">http://tap.xmlns.com/data/</a>><br>
:x a data:7UpBrand<br>
<br>
The n3 grammar do not accept "data:7UpBrand"<br>
<br>
I propose to change qname non terminal definition as follow:<br>
<br>
[qname] : name | ':' n_name_opt<br>
| name ':' n_name_opt<br>
;<br>
<br>
n_name_opt :<br>
| n_name<br>
;<br>
<br>
where n_name is a name that can start with a digit<br>
<br>
Luc Peuvrier<br>
<br>
<br>
<br>
<br>
</div></blockquote>
</blockquote></div><br>
<p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24258244Re: qname shortland starting with a digit2009-06-29T10:18:47Z2009-06-29T10:18:47ZSeaborne, Andy<br><br>Tim rdf wrote:
<br>> Luc,
<br>>
<br>> Sesame 2.2.4 does not handle digits at the start of the local part of a QName, either. (Perhaps 3.0b does, but I haven't found the time)
<br>>
<br>> Jena 2.5.4 and Jena 2.6.0 do, however.
<br>>
<br>> Rather annoying behavior. I heard claims of "Historic XML namespace QName compliance", but Saxon handles elements with "digit names" in Plain Old XML....
<br>>
<br>> Does anyone know why tools are mixed on how they handled digits in QNames? I would imagine that it would be a natural desire.
<br><br><br>The Jena reader is adhering to the principle of being permissive in what
<br>it accepts. The Jena readers for Turtle are derived from SPARQL where
<br>the local part of a prefixed name does allow a digit as the start char.
<br><br>QNames (as in the XML Namespaces concept) do not allow the local part to
<br>start with digit. SPARQL does not call it's abbreviations "qnames".
<br><br>Turtle submission:
<br>"""
<br>10. Turtle compared to SPARQL
<br>...
<br># SPARQL allows '.'s in names in all positions apart from the first or last.
<br># SPARQL allows digits in the first character of the PN_LOCAL lexical
<br>token. In Turtle, the only ascii characters allowed in a nameStartChar
<br>are [A-Z] | "_" | [a-z].
<br>"""
<br><br>SPARQL changed to allow the leading digits in the local part during the
<br>time of the original working group based on quite a lot of user input.
<br><br>I don't know of any reason not to accept digits at the start of the
<br>local part. For URIs derived from other naming schemes, it comes up
<br>naturally and forcing full forms <>, or strange prefix choices, adds no
<br>value.
<br><br> Andy
<br><br><br><div class='shrinkable-quote'><br>>
<br>> Regards,
<br>> Tim Lebo
<br>>
<br>> On Mon, Apr 27, 2009 at 5:49 AM, luc peuvrier at home <<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24258244&i=0" target="_top" rel="nofollow">lc.pvrr@...</a><mailto:<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24258244&i=1" target="_top" rel="nofollow">lc.pvrr@...</a>>> wrote:
<br>> Hi,
<br>>
<br>> For the following uri <<a href="http://tap.xmlns.com/data/7UpBrand" target="_top" rel="nofollow">http://tap.xmlns.com/data/7UpBrand</a>>
<br>>
<br>> A n3 file can contains:
<br>>
<br>> @prefix data: <<a href="http://tap.xmlns.com/data/" target="_top" rel="nofollow">http://tap.xmlns.com/data/</a>>
<br>> :x a data:7UpBrand
<br>>
<br>> The n3 grammar do not accept "data:7UpBrand"
<br>>
<br>> I propose to change qname non terminal definition as follow:
<br>>
<br>> [qname] : name | ':' n_name_opt
<br>> | name ':' n_name_opt
<br>> ;
<br>>
<br>> n_name_opt :
<br>> | n_name
<br>> ;
<br>>
<br>> where n_name is a name that can start with a digit
<br>>
<br>> Luc Peuvrier
<br>>
<br>>
<br>>
<br>>
</div><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24252684Re: qname shortland starting with a digit2009-06-28T09:00:00Z2009-06-28T09:00:00ZtimrdfLuc,<br>
<br>
Sesame 2.2.4 does not handle digits at the start of the local part of a
QName, either. (Perhaps 3.0b does, but I haven't found the time)<br>
<br>
Jena 2.5.4 and Jena 2.6.0 do, however.<br>
<br>
Rather annoying behavior. I heard claims of "Historic XML namespace
QName compliance", but Saxon handles elements with "digit names" in Plain Old XML....<br><br>Does anyone know why tools are mixed on how they handled digits in QNames? I would imagine that it would be a natural desire.<br>
<br>Regards,<br>Tim Lebo<br><br><div class="gmail_quote">On Mon, Apr 27, 2009 at 5:49 AM, luc peuvrier at home <span dir="ltr"><<a href="http://old.nabble.com/user/SendEmail.jtp?type=post&post=24252684&i=0" target="_top" rel="nofollow">lc.pvrr@...</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hi,<br>
<br>
For the following uri <<a href="http://tap.xmlns.com/data/7UpBrand" target="_blank" rel="nofollow">http://tap.xmlns.com/data/7UpBrand</a>><br>
<br>
A n3 file can contains:<br>
<br>
@prefix data: <<a href="http://tap.xmlns.com/data/" target="_blank" rel="nofollow">http://tap.xmlns.com/data/</a>><br>
:x a data:7UpBrand<br>
<br>
The n3 grammar do not accept "data:7UpBrand"<br>
<br>
I propose to change qname non terminal definition as follow:<br>
<br>
[qname] : name | ':' n_name_opt<br>
| name ':' n_name_opt<br>
;<br>
<br>
n_name_opt :<br>
| n_name<br>
;<br>
<br>
where n_name is a name that can start with a digit<br><font color="#888888">
<br>
Luc Peuvrier<br>
<br>
<br>
</font></blockquote></div><br>
<p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24218621RuleML-2009 REMINDER - Paper Deadline June 28th2009-06-26T04:26:31Z2009-06-26T04:26:31ZAdrian Paschke RuleML 2009
<br>
<br>3rd International Symposium on Rules, Applications and Interoperability
<br> November 5-7 2009, Las Vegas, Nevada, USA
<br>
<br> <a href="http://2009.ruleml.org/" target="_top" rel="nofollow">http://2009.ruleml.org/</a><br><br> co-located with the 12th Business Rules Forum
<br><br> ----------------------------
<br><br><br><br>**********************************************************************
<br>***** Latest News ******
<br>** Submission Deadline - June 28th **
<br>** ------------------ **
<br>* Deadline, June 28th for full, short and Challenge demo papers **
<br>* Keynotes and special talks by **
<br>* Sandro Hawke about W3C RIF, **
<br>* Donald Chapin about OMG SBVR **
<br>* Paul Vincent about CEP **
<br>* Jans Aßmann (FranzInc. CEO) **
<br>* RuleML in the top 100 venues for impact factor in CiteSeerX **
<br>* Forthcoming RuleML special journal issue **
<br>* Tutorials about W3C RIF, Drools, Business Process Compliance **
<br>* New categories in the Challenge with prestigious prizes **
<br>* Rules standards session, W3C RIF workshop, lunch panel on Web Rules*
<br>* Student grants of the value of up to $1000 plus free registration **
<br>* 20% RuleML-2009 Partner discounts - see registration page **
<br>**********************************************************************
<br><br>This year, the 3rd International Symposium on Rules, Applications and
<br>Interoperability (RuleML-2009) takes place in Las Vegas, Nevada, USA,
<br>collocated with the 12th Business Rules Forum, the world's largest Business
<br>Rules event.
<br><br>The International Symposium on Rules, Applications and Interoperability has
<br>evolved from an annual series of international workshops since 2002,
<br>international conferences in 2005 and 2006, and international symposia since
<br>2007, and is now in the top 100 venues for impact factor (71):
<br><a href="http://citeseerx.ist.psu.edu/stats/venues" target="_top" rel="nofollow">http://citeseerx.ist.psu.edu/stats/venues</a>.
<br><br><br><br>Supported by
<br>===================================================================
<br>W3C, OMG, ACM, AAAI, ECCAI, IAAIL, ACM, Belgian Business Rules Forum
<br>MIT Sloan CIO Symposium, EPTS, BPM Forum Belgium
<br><br>Sponsored by
<br>===================================================================
<br><br>Franz Inc
<br>NICTA (National ICT Australia) Ltd
<br>Corporate Semantic Web
<br>Logic Programming Associated Ltd
<br>ruleCore
<br>JBoss
<br>Modelsystems Ltd
<br><br>(sponsoring opportunities: <a href="http://www.defeasible.org/ruleml2009/sponsors" target="_top" rel="nofollow">http://www.defeasible.org/ruleml2009/sponsors</a>)
<br>===================================================================
<br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24147037Re: a bug in cwm?2009-06-22T06:14:24Z2009-06-22T06:14:24ZHenry Story-2<br><br>On 22 Jun 2009, at 15:11, Story Henry wrote:
<br><br>> $cwm <a href="http://pear.php.net/feeds/bug_1749.rss" target="_top" rel="nofollow">http://pear.php.net/feeds/bug_1749.rss</a> does not work, but the <a href="http://www.w3.org/RDF/Validator/" target="_top" rel="nofollow">http://www.w3.org/RDF/Validator/</a>
<br>> says its ok
<br><br>Odd, now it no longer works in the validator.
<br><br>Henry
<br><br><br>> Henry
<br>>
<br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-24146974a bug in cwm?2009-06-22T06:11:14Z2009-06-22T06:11:14ZStory Henry$cwm <a href="http://pear.php.net/feeds/bug_1749.rss" target="_top" rel="nofollow">http://pear.php.net/feeds/bug_1749.rss</a> does not work, but the <a href="http://www.w3.org/RDF/Validator/" target="_top" rel="nofollow">http://www.w3.org/RDF/Validator/</a>
<br> says its ok
<br><br>Henry
<br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-239082553rd International Symposium on Rules, Applications and Interoperability (RuleML-2009)2009-06-07T00:13:54Z2009-06-07T00:13:54ZAdrian Paschke [Apologies for multiple postings]
<br>
<br> Call for Papers
<br>
<br> RuleML 2009
<br>
<br> 3rd International Symposium on Rules, Applications and Interoperability
<br> November 5-7 2009, Las Vegas, Nevada, USA
<br>
<br> <a href="http://2009.ruleml.org/" target="_top" rel="nofollow">http://2009.ruleml.org/</a><br><br> co-located with the 12th Business Rules Forum
<br><br> ----------------------------
<br><br>Latest news
<br><br>* Student grants of the value of up to $1000 plus free registration
<br>* Keynote by Sandro Hawke, W3C RIF Contact - The Future of Rule Interchange
<br>* New categories in the Challenge with prestigious prizes
<br>* Rules standards session, workshop on W3C RIF, and joint BRF/RuleML lunch
<br> panel on Web Rules
<br><br><br>Sponsored by
<br>===================================================================
<br><br>Franz Inc
<br>NICTA (National ICT Australia) Ltd
<br>Corporate Semantic Web
<br>Logic Programming Associated Ltd
<br>ruleCore
<br>JBoss
<br>Modelsystems Ltd
<br>===================================================================
<br><br><br>Overview and Aim
<br>===================================================================
<br><br>The International Symposium on Rules, Applications and Interoperability has
<br>evolved from an annual series of international workshops since 2002,
<br>international conferences in 2005 and 2006, and international symposia since
<br>2007. This year, the 3rd International Symposium on Rules, Applications and
<br>Interoperability (RuleML-2009) takes place in Las Vegas, Nevada, USA,
<br>collocated with the 12th Business Rules Forum, the world's largest Business
<br>Rules event. RuleML-2009 is devoted to practical distributed rule
<br>technologies and rule-based applications which need language standards for
<br>rules (inter)operating in, e.g., the Semantic Web, Multi-Agent Systems,
<br>Event-Driven Architectures, and Service-Oriented Applications.
<br><br>The main goal of RuleML-2009 is to stimulate the cooperation and
<br>interoperability between business and research, by bringing together rule
<br>system providers, participants in rule standardization efforts, open source
<br>communities, practitioners, and researchers. The concept of the symposium
<br>has also advanced continuously in the face of extremely rapid progress in
<br>practical rule and event processing technologies. As a result, RuleML-2009
<br>will feature hands-on demonstrations and challenges alongside a wide range
<br>of thematic tracks, and thus will be an exciting venue to exchange new ideas
<br>and experiences on all issues related to the engineering, management,
<br>integration, interoperation and interchange of rules in open distributed
<br>environments such as the Web.
<br><br>Conference Theme
<br>===================================================================
<br><br>This year, we particularly welcome submissions that address applications of
<br>Web rule technologies for business and information systems. We invite you to
<br>share your ideas, results, and experiences: as an industry practitioner,
<br>rule system provider, technical expert and developer, rule user or
<br>researcher, exploring foundations, developing systems and applications, or
<br>using rule-based systems. We invite high-quality submissions related to (but
<br>not limited to) one or more of the following topics:
<br><br>Track Topics
<br>----------------------------------------------------------------------------
<br><br>Rule Transformation and Extraction
<br> - Transformation and extraction with rule standards, such as SBVR, RIF and
<br><br> OCL
<br> - Extraction of rules from code
<br> - Transformation and extraction in the context of frameworks such as KDM
<br> (Knowledge Discovery meta-model)
<br> - Extraction of rules from natural language
<br> - Transformation or rules from one dialect into another
<br><br>Rules and Uncertainty
<br> - Languages for the formalization of uncertainty rules
<br> - Probabilistic, fuzzy and other rule frameworks for reasoning with
<br> uncertain or incomplete information
<br> - Handling inconsistent or disparate rules using uncertainty
<br> - Uncertainty extensions of event processing rules, business rules,
<br> reactive rules, causal rules, derivation rules, association rules, or
<br> transformation rules
<br><br>Rules and Norms
<br> - Methodologies for modeling regulations using both ontologies and rules
<br> - Defeasibility: modeling rule exceptions and priority relations among
<br> rule
<br> - The relationship between rules and legal argumentation schemes
<br> - Rule language requirements for the "isomorphic" modeling of legislation
<br> - Rule based inference mechanism for legal reasoning
<br> - E-contracting and automated negotiations with rule-based declarative
<br> strategies
<br><br>Rule-based Game AI
<br> - Rule-based movement, decision making, strategies, behavior design
<br> - Rule-based environmental programming, virtual reality
<br> - Rules for multi-agent/character games
<br> - Rules for serious games
<br> - Rule-based agent design
<br><br>Rule-based Event Processing and Reaction Rules
<br> - Reaction rule languages and engines (production rules, ECA rules, logic
<br> event action formalisms, vocabularies/ontologies)
<br> - State management approaches and frameworks
<br> - Concurrency control and scalability
<br> - Event and action definition, detection, consumption, termination,
<br> lifecycle management
<br> - Dynamic rule-based workflows and intelligent event processing (rule-
<br> based CEP)
<br> - Non-functional requirements, use of annotations, metadata to capture
<br> those
<br> - Design time and execution time aspects of rule-based (Semantic) Business
<br><br> Processes Modeling and Management
<br> - Practical and business aspects of rule-based (Semantic) Business Process
<br><br> Management (business scenarios, case studies, use cases etc.)
<br><br>Rules and Cross Industry Standards
<br> - Rules in Current Industry Standards, including:
<br> - XBRL: Extensible Business Reporting Language
<br> - MISMO: Mortgage Industry Standards Maintenance Org
<br> - FIXatdl: FIX Algorithmic Trading Definition Language
<br> - FpML: Financial products Markup Language
<br> - HL7: Health Level 7
<br> - Acord: Association for Cooperative Operations Research and Development
<br><br> (Insurance Industry)
<br> - Rules for Governance, Risk, & Compliance (GRC), e.g., rules for internal
<br><br> audit, SOX compliance, enterprise risk management (ERM), operational
<br> risk, etc
<br> - Rules and Corporate Actions
<br>
<br>General Rule Topics
<br> - Rules and ontologies
<br> - Execution models, rule engines, and environments
<br> - From rules to FOL to modal logics
<br> - Rule-based reasoning with non-monotonic negation, modalities, deontic,
<br> temporal, priority, scoped or other rule qualification
<br> - Rule-based default reasoning with default logic, defeasible logic, and
<br> answer set programming
<br> - Graphical processing, modelling and rendering of rules
<br> - Rules in Semantic Web Technologies
<br> - Miscellaneous rule topics
<br>
<br>Case studies, experience reports, and industrial problem statements are
<br>particularly encouraged.
<br><br>RuleML-2009 Challenge
<br>===================================================================
<br><br>The RuleML-2009 Demo Challenge is one of the highlights of RuleML-2009. We
<br>invite submissions of demo papers and demos where rules are used in
<br>interesting and practically relevant ways to, e.g., derive useful
<br>information, transform knowledge, provide decision support and provide
<br>automated rule-based monitoring, enforcement, validation or management of
<br>the behavioural logic of the application. The Challenge offers participants
<br>the chance to demonstrate their commercial and open source tools, use cases,
<br>and applications. Submissions are solicited in these categories:
<br><br> - Benchmarks (test cases, suites) with evaluations of (their own, other)
<br> rule engines and/or rule translators, possibly drawing on our growing
<br> pool at <a href="http://ruleml-challenge.cs.nccu.edu.tw" target="_top" rel="nofollow">http://ruleml-challenge.cs.nccu.edu.tw</a><br> - Case studies (use cases) implemented via engines/translators employing
<br> rule standards such as RIF, RuleML, CLIPS, Common Logic, SBVR, and ISO
<br> Prolog.
<br><br>We welcome all demos about tools and applications using rules such as:
<br><br> - Derivation rules, including query and integrity rules
<br> - ECA rules, including production rules, reaction rules, and rule-based
<br> CEP languages
<br><br>Authors of demo are also invited to submit a Challenge demo paper for
<br>publications in the conference proceedings, see the submission section below
<br>for submission details.
<br><br>Prizes will be awarded to the two best applications from each category. All
<br>accepted demos will be presented in a special Challenge Session. A
<br>submission to the RuleML Challenge has to meet the requirement that
<br>declarative rules explicitly play a central role in the application.
<br>Basically this means that:
<br>Rules are explicitly represented in a declarative format and they are
<br>decoupled from the application (rather than being compiled or hard-coded
<br>into the application logic). The demo should preferably (but not
<br>necessarily) be embedded into a web-based or distributed environment so that
<br>there will be a need for features related to the RuleML conference topics,
<br>as listed in the call for papers. For more details and the demo site web
<br>link please consult the RuleML-2009 Challenge website:
<br><br> <a href="http://ruleml-challenge.cs.nccu.edu.tw" target="_top" rel="nofollow">http://ruleml-challenge.cs.nccu.edu.tw</a><br><br><br>Student Grant Awards
<br>===================================================================
<br><br>Two travel grants are available to students who are authors or co-authors of
<br>papers or demos accepted for presentation at the symposium. The grants
<br>include free registration and cover travel expenses up to 1000 dollars.
<br><br><br>Conference Language
<br>===================================================================
<br><br>The official language of the conference will be English.
<br><br><br>Submission
<br>===================================================================
<br><br>Authors are invited to submit original contributions of practical relevance
<br>and technical rigor in the field, experience reports and show case/use case
<br>demonstrations of effective, practical, deployable rule-based technologies
<br>or applications in distributed environments. Papers must be in English and
<br>may be submitted at
<br><br> <a href="http://www.easychair.org/conferences/?conf=ruleml2009" target="_top" rel="nofollow">http://www.easychair.org/conferences/?conf=ruleml2009</a><br><br>as:
<br><br>Full Papers (15 pages in the proceedings)
<br>Short Papers (8 pages in the proceedings)
<br>RuleML-2009 Challenge Demo Paper + Show Cases (3-5 pages in the proceedings)
<br><br>Please upload all submissions as PDF files in LNCS format
<br>(<a href="http://www.springer.de/comp/lncs/authors.html" target="_top" rel="nofollow">http://www.springer.de/comp/lncs/authors.html</a>). To ensure high quality,
<br>submitted papers will be carefully peer-reviewed by 3 PC members based on
<br>originality, significance, technical soundness, and clarity of exposition.
<br>Authors are requested to upload the abstracts of their papers before June 9,
<br>2009 and to upload their complete papers by June 16, 2009. The selected
<br>papers will be published in book form in the Springer Lecture Notes in
<br>Computer Science (LNCS) series along with a CD with demo software and
<br>documents. The best paper from all submissions will be determined by the PC
<br>and a Best Paper Award will be handed over at the Symposium by a Sponsor.
<br>All submissions must be done electronically. A selection of revised papers
<br>will be resubmitted to a special issue of a journal.
<br>
<br>Submissions to the RuleML Challenge 2009 consist of a demo paper of 3-5
<br>pages, describing the demo show case, and a link to more information about
<br>the demo/show case, e.g. a project site, an online demonstration, a
<br>presentation about the demonstration, or a download site for the
<br>demonstration. In case of product demos, the link can be password-protected:
<br>please submit a password for anonymous login from any Web browser, giving us
<br>the permission to pass the password on to 3 PC members. The submissions
<br>should satisfy the minimal requirements defined in the topics of interest
<br>and preferably exhibit some of the additional desiderata. The more
<br>desiderata are met by an application, the higher the score will be. The
<br>demos will be evaluated by the RuleML-2009 Program Committee and prizes will
<br>be awarded to the two best applications, sponsored by the RuleML Inc.
<br>non-profit organization.
<br><br>
<br>Review Process
<br>===================================================================
<br><br>The submitted papers will pass the blind review process. At least three
<br>members of the Program Committee will review each submission.
<br><br>
<br>Important Dates:
<br>===================================================================
<br><br>Abstract submission deadline: June 9, 2009
<br>Paper Submission deadline: June 16, 2009
<br>Notification of acceptance: July 18, 2009
<br>Camera ready due: August 9, 2009
<br>Symposium dates: November 5-7, 2009
<br>RuleML Challenge: November 5, 2009
<br><br><br>Conference Venue
<br>===================================================================
<br><br>RuleML-2009 will take place at the Bellagio in Las Vegas collocated with the
<br>Business Rules Forum.
<br><br><br>Keynote Speakers
<br>===================================================================
<br>- Sandro Hawke, W3C RIF Team Contact
<br> The Future of Rule Interchange
<br>- TBA
<br><br><br>Programme Committee
<br>===================================================================
<br><br>General Chair
<br>--------------------
<br>Adrian Paschke, Freie Universitaet Berlin, Germany
<br><br>Program Chairs
<br>--------------------
<br>Guido Governatori, NICTA, Australia
<br>John Hall, Model Systems, UK
<br><br>Liaison Chair
<br>--------------------
<br>Hai Zhuge, Chinese Academy of Sciences
<br><br>Publicity Chair
<br>--------------------
<br>William Langley, NRC-IRAP, Canada
<br><br>Track Chairs
<br><br>Rule Transformation and Extraction
<br>--------------------
<br>Erik Putrycz, Canada
<br>Mark Linehan, IBM, USA
<br><br>Rules and Uncertainty
<br>--------------------
<br>Matthias Nickles, University of Bath, UK
<br>Davide Sottara, University Bologna, Italy
<br><br>Rules and Norms
<br>--------------------
<br>Thomas Gordon, Fraunhofer FOKUS, Germany
<br>Antonino Rotolo, CIRSFID, University of Bologna, Italy
<br><br>Rule-based Game AI
<br>--------------------
<br>Benjamin Craig, National Research Council, Canada
<br>Weichang Du, University of New Brunswick, Canada
<br><br>Rule-based Event Processing and Reaction Rules
<br>--------------------
<br>Alex Kozlenkov, Betfair Ltd., UK
<br>Adrian Paschke, Free Univ. Berlin, Germany
<br><br>Rules and Cross Industry Standards
<br>--------------------
<br>Tracy Bost, Valocity, USA
<br>Robert Golan, DBMind, USA
<br><br>RuleML Challenge
<br>--------------------
<br>Yuh-Jong Hu, National Chengchi University, Taiwan
<br>Ching-Long Yeh, Tatung University, Taiwan
<br>Wolfgang Laun, Thales Rail Signalling Solutions GesmbH, Austria
<br><br>Program Committee Members
<br>--------------------
<br><a href="http://2009.ruleml.org/pc" target="_top" rel="nofollow">http://2009.ruleml.org/pc</a><br><br><br><br>RuleML 2009 Sponsors
<br>===================================================================
<br><br>Silver Sponsors
<br>--------------------
<br>NICTA (National ICT Australia) Ltd
<br>Corporate Semantic Web
<br>Franz Inc
<br><br>Bronze Sponsors
<br>--------------------
<br>Logic Programming Associated Ltd
<br>ruleCore
<br>jBoss
<br>Modelsystems Ltd
<br><br><br>RuleML 2009 Partners
<br>===================================================================
<br>W3C, World Wide Web Consortium
<br>OMG, Object Management Group
<br>ACM, Association for Computer Machinery
<br>AAAI
<br>ECCAI
<br>International Association for Artificial Intelligence and Law
<br>ACM SigMis
<br>ACM SigArt
<br>Belgian Business Rules Forum
<br>MIT Sloan CIO Symposium
<br>EPTS, Event Processing Technical Society
<br>BPM Forum Belgium
<br>October Rules Fest
<br>SKG2009 5th International Conference on Semantic, Knowledge and Grid
<br>RR-2009 3rd International Conference on Web Reasoning and Rule Systems
<br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-23766408OWL DatatypeRestriction instead of CWM builtins?2009-05-28T10:34:29Z2009-05-28T10:34:29ZJeff Thompson-5CWM gets math through builtins like math:cos which require extending RDF
<br>to allow subject literals and using ad-hoc hooks for "intercepting" the
<br>use of builtins as predicates:
<br>@forSome :_g0 .
<br>0.0 math:cos :_g0 .
<br>:myDoor :hasHeight :_g0 .
<br><br>(Thus, the reasoner can conclude :myDoor :hasHeight 1.0 .)
<br><br>But can't the same thing be achieved through the OWL DatatypeRestriction?
<br>:myDoor a [owl:onProperty :hasHeight; owl:someValuesFrom [owl:onDatatype
<br>xsd:double; withRestrictions (mathx:cos 0.0)]]
<br><br>Datatype restrictions are where OWL allows "hooks" where the reasoner
<br>must have builtins to know about datatypes. The reasoner can conclude that
<br>[owl:onDatatype xsd:double; withRestrictions (math2:cos 0.0)]]
<br>is a singleton class which is equivalent to [owl:oneOf (1.0)]
<br>and so
<br>myDoor a [owl:onProperty :hasHeight; owl:someValuesFrom [owl:oneOf (1.0)]]
<br>is equivalent to
<br>myDoor a [owl:onProperty :hasHeight; owl:hasValue 1.0]
<br>which is finally
<br>:myDoor :hasHeight 1.0
<br><br>This is all pretty convoluted, but it stays within the semantics of OWL
<br>and relies in its given hooks for builtins (and could really use some
<br>syntactic sugar to help out).
<br>Has anyone looked at using DatatypeRestriction to get functions like
<br>math:cos into OWL reasoners?
<br><br>Thanks for any help,
<br>- Jeff
<br><br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-235082922nd CFP RuleML-2009 - 3rd International Symposium on Rules, Applications and Interoperability2009-05-12T11:52:23Z2009-05-12T11:52:23ZAdrian Paschke<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv=Content-Type content="text/html; charset=us-ascii">
<meta name=Generator content="Microsoft Word 12 (filtered medium)">
<!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang=DE link=blue vlink=purple>
<div class=Section1>
<p class=MsoNormal><o:p> </o:p></p>
<p class=MsoPlainText><span lang=EN-US>
-----------------------------------------------------------------------<o:p></o:p></span></p>
<p class=MsoPlainText><span lang=EN-US>
Our apologies if you receive duplicates of this posting.<o:p></o:p></span></p>
<p class=MsoPlainText><span lang=EN-US> Please feel free to
distribute it to those who might be interested.<o:p></o:p></span></p>
<p class=MsoPlainText><span lang=EN-US> </span>-----------------------------------------------------------------------<o:p></o:p></p>
<p class=MsoPlainText><span style='color:#1F497D'><o:p> </o:p></span></p>
<p class=MsoPlainText><span style='color:#1F497D'><o:p> </o:p></span></p>
<p class=MsoPlainText>
Call for Papers<o:p></o:p></p>
<p class=MsoPlainText>
<o:p></o:p></p>
<p class=MsoPlainText>
RuleML 2009<o:p></o:p></p>
<p class=MsoPlainText>
<o:p></o:p></p>
<p class=MsoPlainText> 3rd International Symposium on Rules,
Applications and Interoperability<o:p></o:p></p>
<p class=MsoPlainText>
November 5-7 2009, Las Vegas, Nevada, USA<o:p></o:p></p>
<p class=MsoPlainText>
<o:p></o:p></p>
<p class=MsoPlainText>
http://2009.ruleml.org/<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>****************************************************************************<o:p></o:p></p>
<p class=MsoPlainText>*Latest
news *<o:p></o:p></p>
<p class=MsoPlainText>*Student grants of the value of up to $1000 plus free
registration *<o:p></o:p></p>
<p class=MsoPlainText>*Keynote by Sandro Hawke, W3C RIF Contact - The
Future of Rule Interchange*<o:p></o:p></p>
<p class=MsoPlainText><span lang=EN-US>*Prestigious prizes and new categories
in the RuleML<span style='color:#1F497D'>-</span>2009 Challenge
*</span><span lang=EN-US style='font-size:11.0pt;font-family:"Calibri","sans-serif"'><o:p></o:p></span></p>
<p class=MsoPlainText>****************************************************************************<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Sponsored by<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>Franz Inc<o:p></o:p></p>
<p class=MsoPlainText>NICTA (National ICT Australia) Ltd<o:p></o:p></p>
<p class=MsoPlainText>Corporate Semantic Web<o:p></o:p></p>
<p class=MsoPlainText>Logic Programming Associated Ltd<o:p></o:p></p>
<p class=MsoPlainText>Modelsystems Ltd<o:p></o:p></p>
<p class=MsoPlainText>ruleCore<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Overview and Aim<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>The International Symposium on Rules, Applications and
Interoperability has<o:p></o:p></p>
<p class=MsoPlainText>evolved from an annual series of international workshops
since 2002,<o:p></o:p></p>
<p class=MsoPlainText>international conferences in 2005 and 2006, and
international symposia since<o:p></o:p></p>
<p class=MsoPlainText>2007. This year, the 3rd International Symposium on
Rules, Applications and<o:p></o:p></p>
<p class=MsoPlainText>Interoperability (RuleML-2009) takes place in Las Vegas,
Nevada, USA,<o:p></o:p></p>
<p class=MsoPlainText>collocated with the 12th Business Rules Forum, the
world's largest Business<o:p></o:p></p>
<p class=MsoPlainText>Rules event. RuleML-2009 is devoted to practical
distributed rule<o:p></o:p></p>
<p class=MsoPlainText>Technologies and rule-based applications which need
language standards for <o:p></o:p></p>
<p class=MsoPlainText>Rules (inter)operating in, e.g., the Semantic Web,
Multi-Agent Systems,<o:p></o:p></p>
<p class=MsoPlainText>Event-Driven Architectures, and Service-Oriented
Applications. <o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>The main goal of RuleML-2009 is to stimulate the
cooperation and<o:p></o:p></p>
<p class=MsoPlainText>interoperability between business and research, by
bringing together rule<o:p></o:p></p>
<p class=MsoPlainText>system providers, participants in rule standardization
efforts, open source<o:p></o:p></p>
<p class=MsoPlainText>communities, practitioners, and researchers. The concept
of the symposium<o:p></o:p></p>
<p class=MsoPlainText>has also advanced continuously in the face of extremely
rapid progress in<o:p></o:p></p>
<p class=MsoPlainText>practical rule and event processing technologies. As a
result, RuleML-2009<o:p></o:p></p>
<p class=MsoPlainText>will feature hands-on demonstrations and challenges
alongside a wide range<o:p></o:p></p>
<p class=MsoPlainText>of thematic tracks, and thus will be an exciting venue to
exchange new <o:p></o:p></p>
<p class=MsoPlainText>ideas and experiences on all issues related to the
engineering, management,<o:p></o:p></p>
<p class=MsoPlainText>integration, interoperation and interchange of rules in
open distributed <o:p></o:p></p>
<p class=MsoPlainText>environments such as the Web.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Conference Theme<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>This year, we particularly welcome submissions that
address applications of<o:p></o:p></p>
<p class=MsoPlainText>Web rule technologies for business and information systems.
We invite you to<o:p></o:p></p>
<p class=MsoPlainText>share your ideas, results, and experiences: as an
industry practitioner,<o:p></o:p></p>
<p class=MsoPlainText>rule system provider, technical expert and developer,
rule user or <o:p></o:p></p>
<p class=MsoPlainText>researcher, exploring foundations, developing systems and
applications, <o:p></o:p></p>
<p class=MsoPlainText>or using rule-based systems. We invite high-quality
submissions related to <o:p></o:p></p>
<p class=MsoPlainText>(but not limited to) one or more of the following topics:<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Track Topics<o:p></o:p></p>
<p class=MsoPlainText>----------------------------------------------------------------------------<span style='color:#1F497D'><o:p></o:p></span></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rule Transformation and Extraction<o:p></o:p></p>
<p class=MsoPlainText> - Transformation and extraction with rule
standards, such as SBVR, RIF and<o:p></o:p></p>
<p class=MsoPlainText> OCL<o:p></o:p></p>
<p class=MsoPlainText> - Extraction of rules from code<o:p></o:p></p>
<p class=MsoPlainText> - Transformation and extraction in the context of
frameworks such as KDM<o:p></o:p></p>
<p class=MsoPlainText> (Knowledge Discovery meta-model)<o:p></o:p></p>
<p class=MsoPlainText> - Extraction of rules from natural language<o:p></o:p></p>
<p class=MsoPlainText> - Transformation or rules from one dialect into
another<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rules and Uncertainty<o:p></o:p></p>
<p class=MsoPlainText> - Languages for the formalization of uncertainty
rules<o:p></o:p></p>
<p class=MsoPlainText> - Probabilistic, fuzzy and other rule frameworks
for reasoning with<o:p></o:p></p>
<p class=MsoPlainText> uncertain or incomplete information<o:p></o:p></p>
<p class=MsoPlainText> - Handling inconsistent or disparate rules using
uncertainty<o:p></o:p></p>
<p class=MsoPlainText> - Uncertainty extensions of event processing
rules, business rules,<o:p></o:p></p>
<p class=MsoPlainText> reactive rules, causal rules,
derivation rules, association rules, <o:p></o:p></p>
<p class=MsoPlainText> or transformation rules<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rules and Norms<o:p></o:p></p>
<p class=MsoPlainText> - Methodologies for modeling regulations using
both ontologies and rules<o:p></o:p></p>
<p class=MsoPlainText> - Defeasibility: modeling rule exceptions and
priority relations among<o:p></o:p></p>
<p class=MsoPlainText> rules<o:p></o:p></p>
<p class=MsoPlainText> - The relationship between rules and legal
argumentation schemes<o:p></o:p></p>
<p class=MsoPlainText> - Rule language requirements for the
"isomorphic" modeling of legislation<o:p></o:p></p>
<p class=MsoPlainText> - Rule based inference mechanism for legal
reasoning<o:p></o:p></p>
<p class=MsoPlainText> - E-contracting and automated negotiations with
rule-based declarative<o:p></o:p></p>
<p class=MsoPlainText> strategies<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rule-based Game AI<o:p></o:p></p>
<p class=MsoPlainText> - Rule-based movement, decision making, strategies,
behavior design<o:p></o:p></p>
<p class=MsoPlainText> - Rule-based environmental programming, virtual
reality<o:p></o:p></p>
<p class=MsoPlainText> - Rules for multi-agent/character games<o:p></o:p></p>
<p class=MsoPlainText> - Rules for serious games<o:p></o:p></p>
<p class=MsoPlainText> - Rule-based agent design<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rule-based Event Processing and Reaction Rules<o:p></o:p></p>
<p class=MsoPlainText> - Reaction rule languages and engines (production
rules, ECA rules, logic <o:p></o:p></p>
<p class=MsoPlainText> event action formalisms,
vocabularies/ontologies)<o:p></o:p></p>
<p class=MsoPlainText> - State management approaches and frameworks<o:p></o:p></p>
<p class=MsoPlainText> - Concurrency control and scalability<o:p></o:p></p>
<p class=MsoPlainText> - Event and action definition, detection,
consumption, termination, <o:p></o:p></p>
<p class=MsoPlainText> lifecycle management<o:p></o:p></p>
<p class=MsoPlainText> - Dynamic rule-based workflows and intelligent
event processing<o:p></o:p></p>
<p class=MsoPlainText> (rule-based CEP)<o:p></o:p></p>
<p class=MsoPlainText> - Non-functional requirements, use of annotations,
metadata to capture<o:p></o:p></p>
<p class=MsoPlainText> those<o:p></o:p></p>
<p class=MsoPlainText> - Design time and execution time aspects of
rule-based (Semantic) Business<o:p></o:p></p>
<p class=MsoPlainText> Processes Modeling and Management<o:p></o:p></p>
<p class=MsoPlainText> - Practical and business aspects of rule-based
(Semantic) Business Process<o:p></o:p></p>
<p class=MsoPlainText><span lang=EN-US> Management (business
scenarios, case studies, use cases etc.)<o:p></o:p></span></p>
<p class=MsoPlainText><span lang=EN-US><o:p> </o:p></span></p>
<p class=MsoPlainText>Rules and Cross Industry Standards<o:p></o:p></p>
<p class=MsoPlainText> - Rules in Current Industry Standards, including:<o:p></o:p></p>
<p class=MsoPlainText> - XBRL: Extensible Business Reporting
Language<o:p></o:p></p>
<p class=MsoPlainText> - MISMO: Mortgage Industry Standards
Maintenance Org<o:p></o:p></p>
<p class=MsoPlainText> - FIXatdl: FIX Algorithmic Trading
Definition Language<o:p></o:p></p>
<p class=MsoPlainText> - FpML: Financial products Markup
Language<o:p></o:p></p>
<p class=MsoPlainText> - HL7: Health Level 7<o:p></o:p></p>
<p class=MsoPlainText> - Acord: Association for Cooperative
Operations Research and Development<o:p></o:p></p>
<p class=MsoPlainText> (Insurance Industry)<o:p></o:p></p>
<p class=MsoPlainText> - Rules for Governance, Risk, & Compliance
(GRC), e.g., rules for internal<o:p></o:p></p>
<p class=MsoPlainText><span lang=EN-US> audit, SOX
compliance, enterprise risk management (ERM), operational <o:p></o:p></span></p>
<p class=MsoPlainText><span lang=EN-US> </span>risk, etc<o:p></o:p></p>
<p class=MsoPlainText> - Rules and Corporate Actions<o:p></o:p></p>
<p class=MsoPlainText> <o:p></o:p></p>
<p class=MsoPlainText>General Rule Topics<o:p></o:p></p>
<p class=MsoPlainText> - Rules and ontologies<o:p></o:p></p>
<p class=MsoPlainText> - Execution models, rule engines, and environments<o:p></o:p></p>
<p class=MsoPlainText> - From rules to FOL to modal logics<o:p></o:p></p>
<p class=MsoPlainText> - Rule-based reasoning with non-monotonic
negation, modalities, deontic, <o:p></o:p></p>
<p class=MsoPlainText> temporal, priority, scoped or other
rule qualification<o:p></o:p></p>
<p class=MsoPlainText> - Rule-based default reasoning with default logic,
defeasible logic, and <o:p></o:p></p>
<p class=MsoPlainText> answer set programming<o:p></o:p></p>
<p class=MsoPlainText> - Graphical processing, modelling and rendering of
rules<o:p></o:p></p>
<p class=MsoPlainText> - Rules in Semantic Web Technologies(SW),
Artificial Intelligence (AI), <o:p></o:p></p>
<p class=MsoPlainText>
Business Process Modeling (BPM), Cloud Computing (CC), <o:p></o:p></p>
<p class=MsoPlainText>
Intelligent Agents, Model-Driven Architecture (MDA), <o:p></o:p></p>
<p class=MsoPlainText>
Software Engineering (SE), Unified Modeling Language (UML), <o:p></o:p></p>
<p class=MsoPlainText>
e-Learning, e-Commerce, ...<o:p></o:p></p>
<p class=MsoPlainText> - Miscellaneous rule topics<o:p></o:p></p>
<p class=MsoPlainText> <o:p></o:p></p>
<p class=MsoPlainText>Case studies, experience reports, and industrial problem
statements are<o:p></o:p></p>
<p class=MsoPlainText>particularly encouraged.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>RuleML-2009 Challenge <o:p></o:p></p>
<p class=MsoPlainText>============================================================================<span style='color:#1F497D'><o:p></o:p></span></p>
<p class=MsoPlainText><span lang=EN-US>The RuleML-2009 Demo Challenge is one of
the highlights of RuleML-2009. </span>We<o:p></o:p></p>
<p class=MsoPlainText>invite submissions of demos where rules are used in
interesting and<o:p></o:p></p>
<p class=MsoPlainText>practically relevant ways to, e.g., derive useful
information, transform<o:p></o:p></p>
<p class=MsoPlainText>knowledge, provide decision support and provide automated
rule-based<o:p></o:p></p>
<p class=MsoPlainText>monitoring, enforcement, validation or management of the
behavioural logic<o:p></o:p></p>
<p class=MsoPlainText>of the application. The Challenge offers participants the
chance to <o:p></o:p></p>
<p class=MsoPlainText>demonstrate their commercial and open source tools, use
cases, and <o:p></o:p></p>
<p class=MsoPlainText>applications. Submissions are solicited in these
categories:<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText> - Benchmarks (test cases, suites) with evaluations
of (their own, other)<o:p></o:p></p>
<p class=MsoPlainText> rule engines and/or rule translators,
possibly drawing on our growing<o:p></o:p></p>
<p class=MsoPlainText> pool at http://ruleml-challenge.cs.nccu.edu.tw<o:p></o:p></p>
<p class=MsoPlainText> - Case studies (use cases) implemented via
engines/translators employing<o:p></o:p></p>
<p class=MsoPlainText> rule standards such as RIF, RuleML,
CLIPS, Common Logic, SBVR, and ISO<o:p></o:p></p>
<p class=MsoPlainText> Prolog.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>We welcome all demos about tools and applications using rules
such as: <o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText> - Derivation rules, including query and integrity
rules <o:p></o:p></p>
<p class=MsoPlainText> - ECA rules, including production rules, reaction
rules, and rule-based<o:p></o:p></p>
<p class=MsoPlainText><span style='color:#1F497D'> </span>CEP<span style='color:#1F497D'> </span>languages<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Authors of demo are also invited to submit a Challenge
demo paper for<o:p></o:p></p>
<p class=MsoPlainText>publications in the conference proceedings, see the
submission section below<o:p></o:p></p>
<p class=MsoPlainText>for submission details.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Prizes will be awarded to the two best applications from
each category. All<o:p></o:p></p>
<p class=MsoPlainText>accepted demos will be presented in a special Challenge
Session. A<o:p></o:p></p>
<p class=MsoPlainText>submission to the RuleML Challenge has to meet the
requirement that <o:p></o:p></p>
<p class=MsoPlainText>declarative rules explicitly play a central role in the
application. <o:p></o:p></p>
<p class=MsoPlainText>Basically this means that:<o:p></o:p></p>
<p class=MsoPlainText>Rules are explicitly represented in a declarative format
and they are<o:p></o:p></p>
<p class=MsoPlainText>decoupled from the application (rather than being
compiled or hard-coded<o:p></o:p></p>
<p class=MsoPlainText>into the application logic). The demo should preferably
(but not necessarily) <o:p></o:p></p>
<p class=MsoPlainText>be embedded into a web-based or distributed environment
so that there will <o:p></o:p></p>
<p class=MsoPlainText>be a need for features related to the RuleML conference
topics, as listed <o:p></o:p></p>
<p class=MsoPlainText>in the call for papers. For more details and the demo
site web link please <o:p></o:p></p>
<p class=MsoPlainText>consult the RuleML-2009 Challenge website:<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>
http://ruleml-challenge.cs.nccu.edu.tw<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Student Grant Awards<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>Two travel grants are available to students who are
authors or co-authors of<o:p></o:p></p>
<p class=MsoPlainText>papers or demos accepted for presentation at the
symposium. The grants<o:p></o:p></p>
<p class=MsoPlainText>include free registration and cover travel expenses up to
1000 dollars.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Conference Language<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>The official language of the conference will be English.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Submission<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>Authors are invited to submit original contributions of
practical relevance<o:p></o:p></p>
<p class=MsoPlainText>and technical rigor in the field, experience reports and
show case/use case<o:p></o:p></p>
<p class=MsoPlainText>demonstrations of effective, practical, deployable
rule-based technologies<o:p></o:p></p>
<p class=MsoPlainText>or applications in distributed environments. Papers must
be in English and <o:p></o:p></p>
<p class=MsoPlainText>may be submitted at<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>
http://www.easychair.org/conferences/?conf=ruleml2009<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>as:<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Full Papers (15 pages in the proceedings)<o:p></o:p></p>
<p class=MsoPlainText>Short Papers (8 pages in the proceedings)<o:p></o:p></p>
<p class=MsoPlainText>RuleML-2009 Challenge Demo Paper + Show Cases (3-5 pages
in the proceedings)<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Please upload all submissions as PDF files in LNCS format<o:p></o:p></p>
<p class=MsoPlainText>(http://www.springer.de/comp/lncs/authors.html). To
ensure high quality,<o:p></o:p></p>
<p class=MsoPlainText>submitted papers will be carefully peer-reviewed by 3 PC
members based on<o:p></o:p></p>
<p class=MsoPlainText>originality, significance, technical soundness, and
clarity of exposition.<o:p></o:p></p>
<p class=MsoPlainText>Authors are requested to upload the abstracts of their
papers before June 9,<o:p></o:p></p>
<p class=MsoPlainText>2009 and to upload their complete papers by June 16,
2009. The selected<o:p></o:p></p>
<p class=MsoPlainText>Papers will be published in book form in the Springer
Lecture Notes in <o:p></o:p></p>
<p class=MsoPlainText>Computer Science (LNCS) series along with a CD with demo
software and <o:p></o:p></p>
<p class=MsoPlainText>documents. The best paper from all submissions will be
determined by the PC and <o:p></o:p></p>
<p class=MsoPlainText>a Best Paper Award will be handed over at the Symposium
by a Sponsor. All <o:p></o:p></p>
<p class=MsoPlainText>submissions must be done electronically. A selection of
revised papers will be<o:p></o:p></p>
<p class=MsoPlainText> resubmitted to a special issue of a journal.<o:p></o:p></p>
<p class=MsoPlainText> <o:p></o:p></p>
<p class=MsoPlainText>Submissions to the RuleML Challenge 2009 consist of a
demo paper of 3-5<o:p></o:p></p>
<p class=MsoPlainText>pages, describing the demo show case, and a link to more
information about the<o:p></o:p></p>
<p class=MsoPlainText>demo/show case, e.g. a project site, an online
demonstration, a presentation<o:p></o:p></p>
<p class=MsoPlainText>about the demonstration, or a download site for the
demonstration. In case<o:p></o:p></p>
<p class=MsoPlainText>of product demos, the link can be password-protected:
please submit a <o:p></o:p></p>
<p class=MsoPlainText>password for anonymous login from any Web browser, giving
us the permission <o:p></o:p></p>
<p class=MsoPlainText>to pass the password on to 3 PC members. The submissions
should satisfy the <o:p></o:p></p>
<p class=MsoPlainText>minimal requirements defined in the topics of interest
and preferably exhibit <o:p></o:p></p>
<p class=MsoPlainText>some of the additional desiderata. The more desiderata
are met by an <o:p></o:p></p>
<p class=MsoPlainText>application, the higher the score will be. The demos will
be evaluated by the <o:p></o:p></p>
<p class=MsoPlainText>RuleML-2009 Program Committee and prizes will be awarded
to the two best <o:p></o:p></p>
<p class=MsoPlainText>applications, sponsored by the RuleML Inc. non-profit
organization.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText> <o:p></o:p></p>
<p class=MsoPlainText>Review Process<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>The submitted papers will pass the blind review process.
At least three<o:p></o:p></p>
<p class=MsoPlainText>members of the Program Committee will review each
submission.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText> <o:p></o:p></p>
<p class=MsoPlainText>Important Dates:<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>Abstract submission deadline: June 9, 2009<o:p></o:p></p>
<p class=MsoPlainText>Paper Submission deadline: June 16,
2009<o:p></o:p></p>
<p class=MsoPlainText>Notification of acceptance: July 18, 2009<o:p></o:p></p>
<p class=MsoPlainText>Camera ready
due:
August 9, 2009<o:p></o:p></p>
<p class=MsoPlainText>Symposium
dates:
November 5-7, 2009<o:p></o:p></p>
<p class=MsoPlainText>RuleML
Challenge:
November 5, 2009<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Conference Venue<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>RuleML-2009 will take place at the Bellagio in Las Vegas
collocated with the<o:p></o:p></p>
<p class=MsoPlainText>Business Rules Forum.<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Keynote Speakers<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>- Sandro Hawke, W3C RIF Team Contact<o:p></o:p></p>
<p class=MsoPlainText> The Future of Rule Interchange<o:p></o:p></p>
<p class=MsoPlainText>- TBA<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Programme Committee<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>General Chair<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Adrian Paschke, Freie Universitaet Berlin, Germany<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Program Chairs<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Guido Governatori, NICTA, Australia<o:p></o:p></p>
<p class=MsoPlainText>John Hall, Model System, UK<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Liaison Chair<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Hai Zhuge, Chinese Academy of Sciences<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Publicity Chair<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>William Langley, NRC-IRAP, Canada<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Track Chairs<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rule Transformation and Extraction<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Erik Putrycz, Canada<o:p></o:p></p>
<p class=MsoPlainText>Mark Linehan, IBM, USA<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rules and Uncertainty<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Matthias Nickles, University of Bath, UK <o:p></o:p></p>
<p class=MsoPlainText>Davide Sottara, University Bologna, Italy<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rules and Norms<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Thomas Gordon, Fraunhofer FOKUS, Germany <o:p></o:p></p>
<p class=MsoPlainText>Antonino Rotolo, CIRSFID, University of Bologna, Italy<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rule-based Game AI<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Benjamin Craig, National Research Council, Canada <o:p></o:p></p>
<p class=MsoPlainText>Weichang Du, University of New Brunswick, Canada<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rule-based Event Processing and Reaction Rules<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Alex Kozlenkov, Betfair Ltd., UK <o:p></o:p></p>
<p class=MsoPlainText>Adrian Paschke, Free Univ. Berlin, Germany<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Rules and Cross Industry Standards<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Tracy Bost, Valocity, USA <o:p></o:p></p>
<p class=MsoPlainText>Robert Golan, DBMind, USA<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>RuleML Challenge<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Yuh-Jong Hu, National Chengchi University, Taiwan <o:p></o:p></p>
<p class=MsoPlainText>Ching-Long Yeh, Tatung University, Taiwan <o:p></o:p></p>
<p class=MsoPlainText>Wolfgang Laun, Thales Rail Signalling Solutions GesmbH,
Austria<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>RuleML 2009 Sponsors<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Silver Sponsors<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Franz Inc<o:p></o:p></p>
<p class=MsoPlainText>NICTA (National ICT Australia) Ltd<o:p></o:p></p>
<p class=MsoPlainText>Corporate Semantic Web<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>Bronze Sponsors<o:p></o:p></p>
<p class=MsoPlainText>--------------------<o:p></o:p></p>
<p class=MsoPlainText>Logic Programming Associated Ltd<o:p></o:p></p>
<p class=MsoPlainText>Modelsystems Ltd<o:p></o:p></p>
<p class=MsoPlainText>ruleCore<o:p></o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText><o:p> </o:p></p>
<p class=MsoPlainText>RuleML 2009 Partners<o:p></o:p></p>
<p class=MsoPlainText>============================================================================<o:p></o:p></p>
<p class=MsoPlainText>W3C, World Wide Web Consortium<o:p></o:p></p>
<p class=MsoPlainText>Belgian Business Rules Forum<o:p></o:p></p>
<p class=MsoPlainText>MIT Sloan CIO Symposium<o:p></o:p></p>
<p class=MsoPlainText>International Association for Artificial Intelligence and
Law<o:p></o:p></p>
<p class=MsoPlainText>Event Processing Technical Society<o:p></o:p></p>
<p class=MsoPlainText>BPM Forum Belgium<o:p></o:p></p>
<p class=MsoPlainText>October Rules Fest<o:p></o:p></p>
<p class=MsoPlainText>SKG2009 5th International Conference on Semantic,
Knowledge and Grid<o:p></o:p></p>
<p class=MsoPlainText>RR-2009 3rd International Conference on Web Reasoning and
Rule Systems<o:p></o:p></p>
</div>
</body>
</html>
<p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-23383513Announce - EulerGUI 1.12009-05-05T01:51:52Z2009-05-05T01:51:52ZJean-Marc Vanel-2I am pleased to announce version EulerGUI 1.1, a development environment for Semantic Web technologies, written in Java, under LGPL licence .<br><br>Out of the box, you can run :<br>- the Drools inference engine, but with very few of the CWM builtins<br>
- CWM if you have installed it ;)<br><br>In addition, if you install the Yap Prolog engine, you have the latest Euler engine, as explained in the User Manual. Euler has numerous ( and unlisted :( ) extensions compared to CWM. For example a catch-all query is possible:<br>
{ ?S ?P ?O } => { ?S ?P ?O } .<br><br>Euler has most of the CWM builtins, plus its own builtins:<br><a href="http://eulersharp.svn.sourceforge.net/viewvc/eulersharp/trunk/2003/03swap/log-rules.n3" target="_top" rel="nofollow">http://eulersharp.svn.sourceforge.net/viewvc/eulersharp/trunk/2003/03swap/log-rules.n3</a><br>
<br>Download from<br>
<a href="https://sourceforge.net/projects/eulergui" target="_top" rel="nofollow">https://sourceforge.net/projects/eulergui</a><br>
<br>
User Manual here:<br>
<a href="http://eulergui.svn.sourceforge.net/viewvc/eulergui/trunk/eulergui/html/documentation.html" target="_top" rel="nofollow">http://eulergui.svn.sourceforge.net/viewvc/eulergui/trunk/eulergui/html/documentation.html</a><br>
<br>The Change Log is :<br><br>- reading and translating to N3 UML XMI files<br>- reading and translating to N3 EMF eCore files<br>- project pipeline and project import<br>- corrections for Vista and Mac<br>- N3 parser in Java based on parser4j, 4 times quicker, thanks to Luc Peuvrier;<br>
now replaces the old ad-hoc Java parser<br>- implemented e:findall extension in Drools engine<br>- Drools engine : implement integrity_constraint<br>- add to documentation: howto_debug_n3_rules.html<br>- Add class DroolsRunExportedProject , with a main()<br>
to load and run facts and rules independently from EulerGUI,<br> after clicking File / "Export as Drools".<br>- Generated Swing application:<br> - use Drools engine at runtime<br> - able to make a round-trip with user N3 file and see the modifications<br>
in the GUI after re-opening the file.<br> - possibility to fire rules creating exception at runtime<br><br>Preceding announces are here:
<br><a href="http://www.w3.org/Search/Mail/Public/search?type-index=public-cwm-talk&index-type=t&keywords=eulergui&search=Search" target="_top" rel="nofollow">http://www.w3.org/Search/Mail/Public/search?type-index=public-cwm-talk&index-type=t&keywords=eulergui&search=Search</a><br clear="all">
<br>-- <br>Jean-Marc Vanel<br>Consulting, services, training,<br>Rule-based programming, Semantic Web<br><a href="http://jmvanel.free.fr/" target="_top" rel="nofollow">http://jmvanel.free.fr/</a><br>+33 (0)6 89 16 29 52<br>+33 (0)1 39 55 58 16<br>
<p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-23305904Updates to FuXi2009-04-29T14:28:01Z2009-04-29T14:28:01ZChimezie OgbujiA few bugfixes, and minor features were committed to FuXi on trunk.
<br>The FuXi.Rete.Util.renderNetwork method (which uses pydot to render a
<br>graph of a given Rete network) was updated to fix problems with the
<br>rendering of built-ins. The diagram now also includes the number of
<br>times a terminal node (or rule) was fired if the network has been fed
<br>with RDF statements. The registration of additional user-specified
<br>built-ins was fixed. A warning was added for when ReteNetwork objects
<br>are instantiated with a rule store that has already been populated
<br>with rules. The preferred way to do this is:
<br><br> from FuXi.Horn.HornRules import NetworkFromN3
<br> graph = ConjunctiveGraph()
<br> graph.load(ruleStream, format='n3')
<br> network = NetworkFromN3(graph,
<br> additionalBuiltins={.. additional user-
<br>builtins ..})
<br><br>NetworkN3 was added to support the common scenario of simply creating
<br>a Network from a given N3 RDF graph. A fix was added that addressed
<br>an inconsistent bug with N3 rules that have builtins, where setting up
<br>the built-ins on a network was depending on the built-in being at the
<br>end of consequent of a rule. Since RDFLib in-memory graphs do not
<br>guarantee maintaining the serialization order, this was problematic.
<br>A test case was added.
<br><br>Finally InfixOwl was updated to include the ability to delete the
<br>subClassOf, complementOf, etc.. descriptors on Class and Property
<br>objects. So:
<br><br> del infixClass.subClassOf
<br><br>Is the equivalent of:
<br><br> infixClass.graph.remove
<br>((infixClass.identifier,RDFS.subClassOf,None))
<br><br>I.e., it removes all the subClassOf axioms associated with the class
<br>object. Deletion descriptors were added for the following attributes
<br>(the corresponding OWL/RDFS properties managed by these descriptors
<br>are in parenthesis):
<br><br>- type (rdf:type)
<br>- comment / seeAlso / label / subClassOf / domain / range / ... etc...
<br>(rdfs:comment, etc..)
<br>- imports (owl:imports on Ontology objects)
<br>- equivalentClass / disjointWith / complementOf / onProperty /
<br>allValuesFrom / hasValue / cardinality / ... etc..
<br>(owl:equivalentClass, etc.)
<br><br>For more information on these descriptors you can read my OWLED 2008
<br>submission regarding InfixOWL:
<br><br> <a href="http://www.webont.org/owled/2008/papers/owled2008eu_submission_19.pdf" target="_top" rel="nofollow">http://www.webont.org/owled/2008/papers/owled2008eu_submission_19.pdf</a><br><br>I still have yet to update the user manual to reflect the recent
<br>changes and hope to do this shortly
<br><br>-- Chimezie
<br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-23292789cwm updates for python 2.62009-04-29T00:35:40Z2009-04-29T00:35:40ZDrew PerttulaHere are some module name tweaks and one method rewrite that take care
<br>of the deprecation warnings in python 2.6 (which a lot of people might
<br>see this week due to the new Ubuntu release).
<br><br>I did not test these except to confirm that cwm starts up more quietly.
<br>The only controversial change would be my change in term.py where
<br>instead of putting the refcount-protection line in a __new__ method
<br>(which is unfortunately intertwined with the signature of this __init__
<br>and the superclass's __new__), I just put the refcount-protection in the
<br>actual __init__.
<br><br>The patch is for the latest 2000/10/swap/ source, which is from
<br>2008-09-03, I think.
<br><br><br />? build
<br>? cwm_20080903-1_i386.deb
<br>? description-pak
<br>? sparql/__init__.pyc
<br>? sparql/sparql_parser.pyc
<br>? sparql/sparql_table.pyc
<br>? sparql/sparql_tokens.pyc
<br>? sparql/sparql_tokens_table.py
<br>? sparql/sparql_tokens_table.pyc
<br>? sparql/webserver.pyc
<br>Index: cwm_crypto.py
<br>===================================================================
<br>RCS file: /sources/public/2000/10/swap/cwm_crypto.py,v
<br>retrieving revision 1.11
<br>diff -u -r1.11 cwm_crypto.py
<br>--- cwm_crypto.py 21 Jul 2005 15:22:59 -0000 1.11
<br>+++ cwm_crypto.py 29 Apr 2009 07:33:53 -0000
<br>@@ -9,10 +9,10 @@
<br> """
<br>
<br> __author__ = 'Sean B. Palmer'
<br>-__cvsid__ = '$Id: cwm_crypto.py,v 1.11 2005-07-21 15:22:59 syosi Exp $'
<br>+__cvsid__ = '$Id: cwm_crypto.py,v 1.11 2005/07/21 15:22:59 syosi Exp $'
<br> __version__ = '$Revision: 1.11 $'
<br>
<br>-import md5, sha, binascii, quopri, base64
<br>+import hashlib, binascii, quopri, base64
<br> from term import Function, ReverseFunction, LightBuiltIn
<br>
<br> USE_PKC = 1
<br>@@ -103,12 +103,12 @@
<br>
<br> class BI_md5(LightBuiltIn, Function):
<br> def evaluateObject(self, subj_py):
<br>- m = md5.new(subj_py).digest()
<br>+ m = hashlib.md5(subj_py).digest()
<br> return binascii.hexlify(m)
<br>
<br> class BI_sha(LightBuiltIn, Function):
<br> def evaluateObject(self, subj_py):
<br>- m = sha.new(subj_py).digest()
<br>+ m = hashlib.sha1(subj_py).digest()
<br> return binascii.hexlify(m)
<br>
<br> # Create a new RSA key
<br>Index: cwm_string.py
<br>===================================================================
<br>RCS file: /sources/public/2000/10/swap/cwm_string.py,v
<br>retrieving revision 1.37
<br>diff -u -r1.37 cwm_string.py
<br>--- cwm_string.py 15 Feb 2008 00:43:45 -0000 1.37
<br>+++ cwm_string.py 29 Apr 2009 07:33:53 -0000
<br>@@ -15,7 +15,6 @@
<br> from diag import verbosity, progress
<br>
<br> import urllib # for hasContent
<br>-import md5, binascii # for building md5 URIs
<br>
<br> from term import LightBuiltIn, ReverseFunction, Function, UnknownType
<br> from local_decimal import Decimal
<br>Index: llyn.py
<br>===================================================================
<br>RCS file: /sources/public/2000/10/swap/llyn.py,v
<br>retrieving revision 1.186
<br>diff -u -r1.186 llyn.py
<br>--- llyn.py 26 Dec 2007 19:54:11 -0000 1.186
<br>+++ llyn.py 29 Apr 2009 07:33:55 -0000
<br>@@ -57,7 +57,6 @@
<br>
<br>
<br> import urllib # for log:content
<br>-import md5, binascii # for building md5 URIs
<br>
<br> import uripath
<br> from uripath import canonical
<br>Index: term.py
<br>===================================================================
<br>RCS file: /sources/public/2000/10/swap/term.py,v
<br>retrieving revision 1.80
<br>diff -u -r1.80 term.py
<br>--- term.py 26 Dec 2007 19:54:11 -0000 1.80
<br>+++ term.py 29 Apr 2009 07:33:57 -0000
<br>@@ -30,7 +30,7 @@
<br>
<br>
<br> import uripath # DanC's tested and correct one
<br>-import md5, binascii # for building md5 URIs
<br>+import hashlib, binascii # for building md5 URIs
<br>
<br> from uripath import refTo
<br> from RDFSink import runNamespace
<br>@@ -1396,7 +1396,7 @@
<br> Hmm... encoding... assuming utf8? @@test this.
<br> Hmm... for a class of literals including this one,
<br> strictly speaking."""
<br>- x=md5.new()
<br>+ x = hashlib.md5()
<br> x.update(self.string)
<br> d=x.digest()
<br> b16=binascii.hexlify(d)
<br>@@ -1591,13 +1591,10 @@
<br> """This class is a supercalss to any builtin predicate in cwm.
<br>
<br> A binary operator can calculate truth value given 2 arguments"""
<br>- def __new__(cls, *args, **keywords):
<br>- self = Fragment.__new__(cls, *args, **keywords)
<br>- BuiltIn.all.append(self) # to prevent the forgetting of builtins
<br>- return self
<br> all = []
<br>
<br> def __init__(self, resource, fragid):
<br>+ BuiltIn.all.append(self)
<br> Fragment.__init__(self, resource, fragid)
<br>
<br> def eval(self, subj, obj, queue, bindings, proof, query):
<br>Index: why.py
<br>===================================================================
<br>RCS file: /sources/public/2000/10/swap/why.py,v
<br>retrieving revision 1.53
<br>diff -u -r1.53 why.py
<br>--- why.py 27 Jun 2007 17:58:39 -0000 1.53
<br>+++ why.py 29 Apr 2009 07:33:58 -0000
<br>@@ -27,7 +27,6 @@
<br>
<br> import urllib # for hasContent
<br> import uripath # DanC's tested and correct one
<br>-import md5, binascii # for building md5 URIs
<br>
<br> from uripath import refTo
<br> from myStore import Namespace
<br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-23253097qname shortland starting with a digit2009-04-27T02:49:45Z2009-04-27T02:49:45ZlupHi,
<br><br>For the following uri <<a href="http://tap.xmlns.com/data/7UpBrand" target="_top" rel="nofollow">http://tap.xmlns.com/data/7UpBrand</a>>
<br><br>A n3 file can contains:
<br><br> @prefix data: <<a href="http://tap.xmlns.com/data/" target="_top" rel="nofollow">http://tap.xmlns.com/data/</a>>
<br> :x a data:7UpBrand
<br><br>The n3 grammar do not accept "data:7UpBrand"
<br><br>I propose to change qname non terminal definition as follow:
<br><br>[qname] : name
<br> | ':' n_name_opt
<br> | name ':' n_name_opt
<br> ;
<br><br>n_name_opt :
<br> | n_name
<br> ;
<br><br>where n_name is a name that can start with a digit
<br><br>Luc Peuvrier
<br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-23144035Re: log:conjunction and named graphs2009-04-20T13:14:36Z2009-04-20T13:14:36ZDan ConnollyOn Sun, 2009-04-19 at 17:51 -0500, Dan Connolly wrote:
<br>> On Fri, 2009-04-17 at 13:39 -0400, Tim Berners-Lee wrote:
<br><br>Never mind what I said:
<br><br>> you might also try mixing in some rules about owl:sameAs:
<br><br>I tested it and it doesn't help.
<br><br>What Tim said is more relevant:
<br><br>> > There is some optional owl:sameAs processing with --closure=e which
<br>> > does some smushing -- not much.
<br><br>You might try one of the backward chainers, i.e. Euler...
<br>maybe fuxi would help. But as you're quantifying over
<br>formulas, those engines might not help either.
<br><br>--
<br>Dan Connolly, W3C <a href="http://www.w3.org/People/Connolly/" target="_top" rel="nofollow">http://www.w3.org/People/Connolly/</a><br>gpg D3C2 887B 0F92 6005 C541 0875 0F91 96DE 6E52 C29E
<br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>tag:old.nabble.com,2006:post-23135593Re: log:conjunction and named graphs2009-04-19T15:51:35Z2009-04-19T15:51:35ZDan ConnollyOn Fri, 2009-04-17 at 13:39 -0400, Tim Berners-Lee wrote:
<div class='shrinkable-quote'><br>> Henry,
<br>>
<br>>
<br>> You are using owl:sameAs.
<br>>
<br>>
<br>> cwm does not do owl:sameAs processing by default.
<br>>
<br>>
<br>> It is an RDF processor, so it must be able to handle and input and
<br>> output owl:sameAs graphs without processing
<br>>
<br>>
<br>> There is some optional owl:sameAs processing with --closure=e which
<br>> does some smushing -- not much.
</div><br>you might also try mixing in some rules about owl:sameAs:
<br><br>{ ?u = ?uu. ?u ?p ?v. } => { ?uu ?p ?v }.
<br>{ ?u ?p ?v. ?v = ?vv } => { ?u ?p ?vv }.
<br><br>That's taken from
<br> <a href="http://www.w3.org/2000/10/swap/util/owlth.n3" target="_top" rel="nofollow">http://www.w3.org/2000/10/swap/util/owlth.n3</a><br><br>it's a cwm-happy elaboration of rdfp11
<br>from ter-Horst's work.
<br><br># H.J. ter Horst, Completeness, Decidability and Complexity of
<br>Entailment for RDF
<br># Schema and a Semantic Extension Involving the OWL Vocabulary, Revised
<br>and
<br># extended version of [11], Journal of Web Semantics 3 (2005) 79-115.
<br># <a href="http://www.websemanticsjournal.org/ps/pub/2005-15" target="_top" rel="nofollow">http://www.websemanticsjournal.org/ps/pub/2005-15</a><br><br><br>--
<br>Dan Connolly, W3C <a href="http://www.w3.org/People/Connolly/" target="_top" rel="nofollow">http://www.w3.org/People/Connolly/</a><br>gpg D3C2 887B 0F92 6005 C541 0875 0F91 96DE 6E52 C29E
<br><br><br><p>From forum: <a href="http://old.nabble.com/w3.org---public-cwm-talk-f11596.html" embed="fixTarget[11596]" target="_top" >w3.org - public-cwm-talk</a></p>