W3C home > Mailing lists > Public > www-rdf-rules@w3.org > September 2002

Re: Is n3 a rules language or a logic language?

From: Jos De_Roo <jos.deroo.jd@belgium.agfa.com>
Date: Fri, 6 Sep 2002 01:37:05 +0200
To: "Sandro Hawke <sandro" <sandro@w3.org>
Cc: "Peter F. Patel-Schneider" <pfps@research.bell-labs.com>, timbl@w3.org, www-rdf-rules@w3.org, naudts_vannoten@yahoo.com
Message-ID: <OF741C3237.0D52522A-ONC1256C2B.008096D9@agfa.be>
[...]

> (This gives me a fun idea for a cwm test: write resolution in n3, and
> see what things I can get cwm to prove.   I bet I can get cwm to prove
> this isn't the way to implement a fast theorem prover.  :-)

actually Guido Naudts is making a nice attempt in
http://www.agfa.com/w3c/2002/02/thesis/
more specifically
http://www.agfa.com/w3c/2002/02/thesis/engine.n3

-- ,
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Thursday, 5 September 2002 19:37:46 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:53:09 GMT