log:conclusion, log:notIncludes, and infinite formulas

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 UTC