Re: log:conclusion, log:notIncludes, and infinite formulas

Dan Connolly wrote:
> On Thu, 2005-08-25 at 11:38 -0400, Yosi Scharf wrote:
>> Dan Connolly wrote:
>> 
>>> 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.

I couldn't yet test it as for euler I still have to
implement log:conclusion
I did a simpler test

### infaux.n3
@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 ] }.
###

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

{ <infaux.n3> log:semantics ?F.
  ?F log:notIncludes { sky color blue } }
  => { thisTest a Pass }.
###

and indeed,
cwm infaux.n3 --think --filter"=infauxF.n3"
doesn't seem to finish

euler infaux.n3 -nope -filter infauxF.n3
returns with

thisTest a Pass.

-- 
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/

Received on Friday, 26 August 2005 09:56:04 UTC