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

[...]

> (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/