W3C home > Mailing lists > Public > public-cwm-bugs@w3.org > July 2005

log:conclusion, log:notIncludes, and infinite formulas

From: Dan Connolly <connolly@w3.org>
Date: Thu, 07 Jul 2005 17:35:33 -0500
To: public-cwm-bugs@w3.org
Message-Id: <1120775733.10719.108.camel@localhost>

We all know this sends cwm into the weeds...

@keywords is, of, a.
@prefix : <#>.
@prefix log: <http://www.w3.org/2000/10/swap/log#>.

fred a Person.
{ ?WHO a Person } => { ?WHO father [ a Person ] }.

Now suppose that's in <infaux.n3> and consider:

@keywords is, of, a.
@prefix : <#>.
@prefix log: <http://www.w3.org/2000/10/swap/log#>.

{ <infaux.n3>.log:semantics log:conclusion [
	 log:notIncludes { sky color blue } ] }
  => { thisTest a Pass }.


That seems like it should pass, at least in a backward-chaining
reasoner.

If that's the case, then it's wrong to say
that the domain of log:notIncludes is finite formulas,
as in...

[[
 Because a formula is a finite size,
 [...]
]]
 -- section "Implementing defaults and log:notIncludes" 
   of part "Reaching out onto the Web"
   of the Semantic Web Tutorial Using N3
   http://www.w3.org/2000/10/swap/doc/Reach#Implementi


-- 
Dan Connolly, W3C http://www.w3.org/People/Connolly/
D3C2 887B 0F92 6005 C541  0875 0F91 96DE 6E52 C29E
Received on Thursday, 7 July 2005 22:35:37 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 8 January 2008 14:10:59 GMT