- From: <jos.deroo@agfa.com>
- Date: Thu, 2 Feb 2006 21:14:18 +0100
- To: adrianw@snet.net
- Cc: Francois Bry <bry@ifi.lmu.de>, public-rule-workshop-discuss@w3.org
[...] > XSB takes a step in this direction, with 'tabling'. Magic Sets, and > Backchain Iteration [1], exploit the approach more fully**. > > Cheers, -- Adrian > > > [1] Backchain Iteration: Towards a Practical Inference Method that is > Simple Enough to be Proved Terminating, Sound and Complete. Journal of > Automated Reasoning, 11:1-22. > > ** I'm guessing that Euler does this too. Right Jos ? I'm still learning that we should do it less fully :) but more like connected least powered engines... euler is more like a simple webized prolog engine [1] and the python version is even simpler, but evolving. -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ [1] http://eulersharp.sourceforge.net/2003/03swap/FAQ
Received on Thursday, 2 February 2006 20:14:36 UTC