- From: Dave Reynolds <der@hplb.hpl.hp.com>
- Date: Tue, 10 Jun 2003 17:54:05 +0100
- To: Graham Klyne <GK@ninebynine.org>
- CC: www-rdf-logic@w3.org
Graham Klyne wrote: > > At 17:05 09/06/03 +0100, Dave Reynolds wrote: > >Yes and no. We have three engines at present - a pure forward chainer, a > >tabled > >backward chainer and a hybrid in which forward rules can create additional > >backward rules. It is the later that is proving the most useful. The forward > >rule components can perform immediate closure on some of the simpler schema > >entailments and then translate the schema into backward rules which can be > >used > >for instance queries. > > Is this described anywhere? Not yet, sorry, unless you count javadoc comments :-) > I've been mulling hybrid reasoning for some > time, and am currently thinking about it again as part of my Haskell > work. It would be interesting to understand the strategies you are using. I'd be happy to show you examples of where this approach has been useful to see how they might fit with your Haskel work. Dave
Received on Tuesday, 10 June 2003 12:54:26 UTC