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

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

From: Seth Russell <seth@robustai.net>
Date: Thu, 5 Sep 2002 17:26:33 -0700
Message-ID: <01b401c2553c$0e6e3ee0$657ba8c0@c1457248a.sttls1.wa.home.com>
To: "Sandro Hawke <sandro" <sandro@w3.org>, "Jos De_Roo" <jos.deroo.jd@belgium.agfa.com>
Cc: "Peter F. Patel-Schneider" <pfps@research.bell-labs.com>, <timbl@w3.org>, <www-rdf-rules@w3.org>, <naudts_vannoten@yahoo.com>

What does "...." mean in n3 ?

as in the

:arr :contains {
:a :b :c.
:d :e :f.
:v :w :z.}

definedIn <http://www.agfa.com/w3c/2002/02/thesis/engine.n3>


Seth Russell

----- Original Message -----
From: Jos De_Roo
To: Sandro Hawke <sandro
Cc: Peter F. Patel-Schneider ; timbl@w3.org ; www-rdf-rules@w3.org ;
Sent: Thursday, September 05, 2002 4:37 PM
Subject: 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
more specifically

-- ,
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Thursday, 5 September 2002 20:27:31 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 22:46:14 UTC