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

[freed from spam trap -rrs]

Date: Fri, 6 Sep 2002 08:16:45 -0400 (EDT)
Message-ID: <20020906121608.57781.qmail@web40509.mail.yahoo.com>
From: naudts guido <naudts_vannoten@yahoo.com>
To: Seth Russell <seth@robustai.net>, "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


Hallo,

--- Seth Russell <seth@robustai.net> wrote:
 > What does "...." mean in n3 ?
 >
 > as in the
 >
 > :arr :contains {
 > :a :b :c.
 > :d :e :f.
 > ....
 > :v :w :z.}
This is not meant to be a valid n3 statement but just
an indication that a list can be created by
enumeration with a variable size.When applied this
might be:
:arr :contains {
:x1 :value "2".
:x2 :value "7".}
for an array with values 2 and 7.

Guido Naudts

 >
 > definedIn
 > <http://www.agfa.com/w3c/2002/02/thesis/engine.n3>
 >
 > ??
 >
 > Seth Russell
 > http://robustai.net/sailor/
 >
 > ----- Original Message -----
 > From: Jos De_Roo
 > To: Sandro Hawke <sandro
 > Cc: Peter F. Patel-Schneider ; timbl@w3.org ;
 > www-rdf-rules@w3.org ;
 > naudts_vannoten@yahoo.com
 > 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
 > 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 Friday, 6 September 2002 08:56:47 UTC