- From: <jos.deroo@agfa.com>
- Date: Fri, 18 Dec 2009 16:10:51 +0100
- To: connolly@w3.org
- Cc: Jonathan Rees <jar@creativecommons.org>, public-cwm-talk@w3.org
- Message-ID: <OF7FFD6F20.CDD2B185-ONC1257690.00532DCD-C1257690.0053650E@agfa.com>
> worked out of the box and spits out a few 100 lines of proof ending
>> with
>>
>> r:gives {
>> _:sk1 owl:differentFrom _:sk1.
>> <http://penguin-house.example/2008/article2> owl:differentFrom
>> <http://penguin-house.example/2008/article2>.
>> <#Bob> owl:differentFrom <#Bob>.
>> }].
>>
>> #ENDS 160 msec
>
> I'm interested to look at the proof using check.py --report,
> which produces reStructuredText, which I can then convert
> to an HTML table. Maybe you could send it as an attachment?
>
>
>> Eye does bnode to univar rewriting in the rule premis and that
>> rewritten form is used in the proof..
>> Apart from that, check.py should now be happy with the proof, be it
>> that it is a bit redundant
>> i.e. up to 518 steps
>>
>> * - 518
>> - @forSome :_g0 . xx:Bob owl:differentFrom xx:Bob .
>> <http://penguin-house.example/2008/article2> owl:differentFrom
>> <http://penguin-house.example/2008/article2> . :_g0
>> owl:differentFrom :_g0 .
>> - conjoining steps (169, 338, 517)
>> -
>
> Ah... so you're already using check.py --report .
> Send me that too?
The proof resulting from
eye http://www.w3.org/2001/tag/dj9/badmeta.n3
http://www.w3.org/2001/tag/dj9/speech.n3
http://www.w3.org/2001/tag/dj9/httpspeech.n3
http://www.w3.org/2001/tag/dj9/time.n3
http://www.w3.org/2001/tag/dj9/owl2.n3
http://www.w3.org/2000/10/swap/util/owlth.n3
http://www.w3.org/2000/10/swap/util/rdfs-nice.n3 --query
http://www.w3.org/2001/tag/dj9/contradiction.n3
is attached as att1.txt and the check --report is attached as att2.txt
and the latter is not happy with the "bnode to univar rewriting in the
rule premis"
so I tested with manually rewritten rule premises and the proof resulting
from
eye http://eulersharp.sourceforge.net/2007/07test/badmeta.n3
http://eulersharp.sourceforge.net/2007/07test/speech.n3
http://eulersharp.sourceforge.net/2007/07test/httpspeech.n3
http://eulersharp.sourceforge.net/2007/07test/time.n3
http://eulersharp.sourceforge.net/2007/07test/owl2.n3
http://eulersharp.sourceforge.net/2007/07test/owlth.n3
http://eulersharp.sourceforge.net/2007/07test/rdfs-nice.n3 --query
http://eulersharp.sourceforge.net/2007/07test/contradiction.n3
is attached as att3.txt and the check --report is attached as att4.txt
and the latter is now happy :)
I also had to add the string search builtin in Eye and I see that it
is called "scrape" in http://www.w3.org/2000/10/swap/doc/CwmBuiltins
..
>>
>> versus 144 in your http://www.w3.org/2001/tag/dj9/badmeta-pf.html
>>
>> which I am running right now, but still waiting for a cwm result..
>> i.e. I started
>> cwm
>>
http://www.w3.org/2001/tag/dj9/badmeta.n3http://www.w3.org/2001/tag/dj9/speech.n3http://www.w3.org/2001/tag/dj9/httpspeech.n3http://www.w3.org/2001/tag/dj9/time.n3http://www.w3.org/2001/tag/dj9/owl2.n3http://www.w3.org/2000/10/swap/util/owlth.n3http://www.w3.org/2000/10/swap/util/rdfs-nice.n3--solve=http://www.w3.org/2001/tag/dj9/contradiction.n3
--why
>> more than 40 minutes ago
>
> 40 minutes?! It only takes about 10 or 15 seconds, here.
Yes, and this morning when I woke up ut was still running
jdroo 18976 99.9 55.2 1145392 1142316 pts/0 R+ 00:19 610:58 python
/home/jdroo/acasvn/wopeg/cwm/swap/cwm.py
http://www.w3.org/2001/tag/dj9/badmeta.n3 ...
which is more than 10 hours..
This is however an old version of cwm and now I am testing with the latest
CVS
version and that is indeed below 10 sec, waw, what a big difference!
Kind regards,
Jos De Roo | Agfa HealthCare
Senior Researcher | HE/Advanced Clinical Applications Research
T +32 3444 7618
http://www.agfa.com/w3c/jdroo/
Quadrat NV, Kortrijksesteenweg 157, 9830 Sint-Martens-Latem, Belgium
http://www.agfa.com/healthcare
Attachments
- text/plain attachment: att1.txt
Received on Friday, 18 December 2009 15:12:41 UTC